BRABU, MUZAFFARPUR BCA PAPER-III

BRABU, MUZAFFARPUR

BCA PAPER-III 2004

Group A 2. A) what are main differences between a file processing system and DBMS?

B) What are advantages and disadvantages of database system? 3. A) what in an E-R diagram? Explain the term ordinary and modality.

B) Explain the following terms in context of DBMS.

4. A) what are function dependencies? Define the closure of a set of functional dependency with examples.

B) Define the following terms with examples:-

5. A) what is data definition language? Explain any three DDL command with examples.

B) Write SQL statements on the following tables.

I) Emp (Enough, Enm, salary, dept no,) II) Dept (Depot no, Dname)

III) Insert a record in Emp table. IV) Delete a record from Dept table. 6. A) what is hashing? Differentiate between static hash function and dynamic hash function.

B) Explain the tree.

Group B 7. Write a program to represent a queue. Also write function to add, delete and display the element of queue. 8. Create a doubly linked list. Write function to add, delete, display and count the elements of doubly linked list. 9. Write a program to create a Binary search tree, write the function for display in pre-order. 10. Write a program to arrange the elements of an array (11,2,9,13,57,17,1,90,31)in ascending order using:

A) Quick sort or merge sort B) Bubble sort or insertion sort 11. A)

Construct expression tree for the following expression:-I) (A+B*C)-(D*E)

II) ((A+B)*C)-(D*E)

III) A &&B ||C||! (E > F)IV) (A+B) +C+ (D+C+F)*(G+H)

B) The following keys are to be inserted in the order showing into an AVL

tree: 50, 45,80,95,26,43,108,2 so how the tree appears after insertion.

2005

Group A

2. A) Describe the organization of a DBMS? Explain the views of a database.

B) Describes the demerits of a file management system. 3. A) Describe the hierarchical and network model.

B) What is a ‘relation ‘in the relational data model? Describe the types of relationship. 4. A) Define 1NF, 2NF and 3NF with an example.

B) What is referential integrity? Explain with examples.

5. A) what is an index? How can a B+ tree be used in an index?

B) Define cardinality, modality and degree of a relationship with appropriate example. 6. A) write the statement on following relation.

EMP (Eno, Ename, salary, dept_no)

Dept (dept_no, Dname)

I) Increase the salary of all employees by 10% whose salary is less than 3000,

II) Displays the average salary of all employees working in the “SALES” department.

III) Display the name of all employees working in the “RESEARCH” department, whose salary is more than 5000.

B) Describes the following terms with examples.

I) Join II) Projection III) DDL

Group B

7. Write a program to reverse the content of a stack using two other temporary stacks. 8. Write a program to merge the content of two singly linked lists to doubly linked list. 9. Write a function to traverse a Binary tree ‘in order ‘without using recursion 10. for the following set of element:

(2, 1, 10, 3, 6)

Show the steps after each pass in

A) Quick sort B) Bubble sort

11. Write a program to create a highest balanced tree from data stored in linked

list. 2006

Group A

2. Different between any four of the following:

I) Database administrator and database

manager. III) Sub queries and nested queries V) DML and DCL

3. Consider the following relational schema;

Students (s_id, name, phone, program) Subjects

(subject_id, subject_name, taught_by)

II) Super key and primary

key. IV) DBMS and RDBMS

Mark’s (s_id, subject_id, marks)

Make assumptions if any.

Formulate SQL queries for any of the following:-

A) Find the name of students who have passed more than 5 subjects. (For passing a subject, students must get

at least 50 marks.) B) Find the program of the student who has not passed a single course. C) Find the subject that has been passed by all the students who have appeared for the subject. D) Find the list of teachers who have taught more courses than what has been taught by teacher ‘XYZ’.

E) Find the S_id of those students who share the same phone numbers. (Assume that a maximum of two

students can have the same phone number.) 4. A) write the output of any six of the following:

I) Select MOD (35, 6) from dual II) Select LENGTH (‘Upendra Narayan ‘) from dual

III) Select TRUNC (15, 72, and 1) from dual IV) Select ROUND (15, 194, 1) from dual

V) Select POWER (6, 4) from dual VI) Select INITCAP (‘good day ‘) from dual

VII) Select SORT (625) from dual

B) Explain buffer management and shadow paging with an example. 5. A) Table 1: DEPT

DEPTNO (NOT NULL, NUMBER (21), DNAMNVAR CHAR 2(14), LOC (VARCHAR2 (13))

Table 2: EMP

EMPNO (NOT NULL, NUMBER (4;),ENAMEVARCHAR 2(10)),JORDAN CHAR 2(9)),MGR (NUMBER

(4)),HIRDATE(DATE), SAL(NUMBER(7,2)),COMN (NUMBER (7,2)), DEPTNO (NUMBER (2))

MGR – empno of the employees who’s the employee reports to

DEPT – foreign key

Write SQL statement for any four the following:

I) List all the employee who have at least one person reporting to them.

II) List the employee details if and only a more than 10 employees are present in dept no 10. III) List the name of the employee with their immediate higher

authority. IV) List the an employee who do not manage any one V) List the employee’s details whose salary is better than the lowest salary if an employee belongs to dept no 20. B) Explain any two of the following:

I) Aggregate function II) Generalization III) Normalization

6. A) consider the following requirements of a staff management system of an organization:

*The basic information that needs to be sorted about the staff includes staff_id name. Address, date of birth,

date of employment, post held,

*It keeps dependent information of employees an employee can have many dependents

*pay details of the employee are also kept.

*It also keeps the track of the various departments and employees of those departments. Draw the E-R diagram

for the organization. Make suitable assumptions, if any.

B) Write at least an advantage of the database approach.

Group B

7. A) write an algorithm that translate an infix into postfix notation.

B) Write a program to arrange the numbers using insertion sort technique. 8. Write short notes on any three of the following:-

9. A) Write a program to search an item entered by user from a binary search

tree. B) Construct a binary tree of the prefix expression

- + 435/+2436 10. A) what is column – major order? Explain also give the general formula for accessing an element in a

two – dimensional array stored in column – major order.

B) The order of nodes of a Binary tree in pre – order and in – order traversal is as

follows: Pre – order: A B C D F H J M K E G I L N

In – Order: A D J M H K F C I N L G E B

Draw the corresponding Binary tree. 11. A) The following key are to be inserted in the order show into an AVL tree:

23, 75,64,86,43,58,15,26

B) Write a program segment to insert value N after the nodes in the link list. 2007

Group A

2. A) Describe the advantages of DBMS over file systems.

B) What are the Drawbacks of RDBMS? 3. A) what is ER diagram? Mention weak and strong entity.

B) What is an index? How can a B++tree be used as an index? 4. A) Define schema, describe different types of schema.

B) Compare relational, network and hierarchical data model. 5. Write notes on any three:

I) Candidates key II) Referential integrity

III) Domain

IV) Generalization V) Cross products.

6. Write SQL statements for the following:

A) To create table B) Insert a raw in table

C) Delete a recorded

D) Drop D) Drop the given table E) Update student name ‘XYZ ‘in

Group B

7. A) Write a program to search an item entitled by user from a Binary character

B) Consider a Binary tree of the prefix expression. 8. from the following set of elements

6, 57,92,38,44,90,63,73

Show the step after each an assess in

A) Bubble sort B) Selection sort

9. Write notes on any three:

I) Depth of tree II) Linear data structures III) Circular queue

IV) String V) Sequential searching

10. A) Write a function to insert a given element in sorted array.

B) Find a given element in an array. 11. Evaluate the following into postfix to expression:

I) A. B/ (E^D) + (E*F) II) A*(B+C) + (B/D) *A+Z*U

III)A&&B||C||/(C<F) IV) A^B^C*D

2008 Group A

2. A) Define attitudes. Explain different types of attributes with examples of each.

B) Explain selection and Projection with examples. 3. A) What is specialization? Explain with examples.

B) Define union, intersection and cross product with respect to relational algebra. 4. Write notes on any three of the following:

I) Data directory II) Relational data model III) Function dependency

IV) Database administrator V) Normalization

5. A) Define the following terms:

I) Tuple II) Entity III) Cardinality IV) Domain

B) Define key, what is its importance? Explain different types of keys. 6. Write SQL statements for the following:

Book (Book, name, ISBN no, Book published, price)

I) To create table II) Insert the raw in the table. III) Delete a record

IV) Drop the given table V) Update book name ‘ABC’ to ‘DEF’

GROUP B

7. A) What is Binary tree define the different types of Binary tree.

B) Construct a Binary tree whose pre –order and in-order travel are as

follows Pre – order 2, 5,3,6,8,18,15,19

In – order 3, 5, 6,8,12,15,18,19 8. Short notes on any three of the following:

I) Binary search tree II) Dynamic data structure III) Queues IV) Recursion

9. A) Write a function to delete duplicate elements in a double linked list.

B) Write down the difference between linked list and array. 10. A) what is stack? Explain the different operations performed on stack.

B) Write a function to sort a single linked list. 11. A) write a program to multiply two matrices.

B) Write a function for Binary search iterative.

2009

Group A

2. A) Explain drawbacks of file system. HOW DBMS is useful over file system.

B) ”Data directory is structured repository of data about data “. Explain. 3. A) Discuss generalization with examples.

B) Explain different types of database language. 4. A) Draw the structure of DBMS and explain.

B) What is entity set? Discuss strong and weak entities with examples. 5. Write short notes on following:

A) BCNF B) Natural join C) SQL D) super key and candidate key

6. A) Draw E-R diagram for hospital management System.

B) Explain shadows paging and fail classification.

Group B 7. A) write algorithm for bubble sort.

B) Discuss circular queue with suitable examples.

c) Differentiate searching and sorting operation. 8. Write short notes on the following:

9. A) Write a program in C for quick sort.

B) Write a program in C to find largest number from a given set of ten positive integer number entered by user. 10. A) What is difference between linear and non-linear data structures? Explain with examples.

B) Differentiate recursion and iteration with example.

11. A) write a function to sort a singly linked list.

B) What is the use of data structure in computer? What is time complexity? Explain. 2010

Group A

2. A) What is difference between file system and DBMS? Discuss disadvantages of DBMS.

B) Explain selections and Projection with examples.

3. A) Discuss generalization and specialization with suitable examples.

B) What is the of join operation? Describe different types of join.

4. A) what do you mean by normalization? Describe 2NF and 3NF with suitable examples.

B) Discuss shadows paging, transactional mode and buffer management.

5. A) what do you mean by DML? Explain all command of DML with their SQL structure.

B) Define tuple, cardinality super key, candidates key referential integrity and DBA.

6. Write short notes on following:

I) Relational data model II) Database manager III) B-tree index fix

Group B

IV) BCNF

7. A) write down differences between recursion and iteration.

B) Write a function to insert an element before a given element in a single linked list. 8. A) write algorithm for insertion sort and selection sort.

B) What is Binary tree? Write an algorithm 9. A) write a program to multiply two matrices.

B) Write a function for Binary search iterative for an array. 10. A) Discuss stack, queue and linked list with examples.

B) Write a function to sort a single linked list. 11. Write short notes on following:

A) Dynamic data structure B) strictly Binary tree

C) Array D) time and space complexity

2011

Group A

2. A) Discuss the structure of DBMS.

B) What is aggregation? Explain with examples. 3. A) Define schemas. Describe different types of schema.

B) What are the drawbacks of relational database management system? 4. Write the statement for following.

Student (students name, roll, marks)

I) To create a table II) Insert a row in a table III) Delete a record.

5. A) Explain components of ER model.

B) Define foreign key with examples. 6. Explain four of the following:

I) Super key II) Candidate key III) System failure

IV) Functional dependency V) Referential integrity VI) Cross product

Group B

7. A) Write a program to reverse the element of a stack using two temporary stacks.

B) Write a program to arrange the following numbers using quick sort

techniques. 12,7,23,10,4,6,11. 8. A) write a function to sort element of stack using one temporary stack.

B) Write properties of Binary tree, also prove these properties. 9. A) Differentiate the following:

I) Single linked list and double Linked list. II) Stack and queue

B) Convert the following prefix expressions into infix:

I) AB-D+* II) AB+C/D”E III) ABC /+DEFH IV) ABC /+D-

10. Following elements are to be inserted in AVL

tree 50, 45,80,90,26,43,45,22 11. Write short notes on following:

A) Stacks B) linked list C) non lines data structures D) tree

2012

Group A

2. A) Define DBMS. Write down the advantage of DBMS over file system.

B) Discuss briefly network and hierarchical data model. 3. A) what are views? Describe different types of views.

B) Explain generalization with the help of example. 4. A) What is ER diagram? Explain it with the help of example.

B) Explain functional dependency. 5. A) Explain the components of ER diagram.

I) Foreign key II) Primary key III) Candidate key

B) Write SQL statements for the following:-

I) To create table II) Insert a row in the table III) Update book name ‘XYZ’ to ‘ABC’.

6. Write short notes on any two of the following:-

A) Normalization B) Data dictionary C) DBA

D) Specialization E) join and types of join

Group B

7. A) What is stack? Explain the different operation performed on stack.

B) Write a program to find a given element from an array using binary search technique. 8. A) Differentiate the following:-

I) Single linked list and double linked list II) Linked list and array

B) Create a program to implement merge sort. 9. A) Explain briefly the following tree traversal techniques:-

B) Write a program to multiply two matrices. 10. A) Convert the following post-fix expressions into in-fix expressions:-

I) CE -DE+* II) CDE /+M- III) AB+C/D*E B )For the following set of elements:- 44, 40,68,23,38,75,55,61 Show the steps after each pass in insertion sort.

11. Write short notes on any two of the following:-

A) AVL tree B) Double linked list C) Queue

D) Binary tree E) Non -linear data structure

2013

Group A

2. A) Differentiate between DBMS and file system.

B) How many data models in DBMS? Describes briefly. 3. A) Explain where, having and group clause.

B) What are views? Describe with examples. 4. A) What is entry and attributes? Describe with examples.

B) Differentiate between derived and composite attributes. 5. Write SQL statements for the following:

Students (name, date of birth, age)

I) To create a table II) Insert a row in the table

III) Display the value IV) Update student name ‘abc’ to ’xyz‘.

6. Write short notes on any of the following: I) DBA II) Schema III) Constraints IV) Attribute V) Normalization

Group B

7. A) what is stack? Describe it with examples.

B) Differentiate between postfix and infix.

8. A) Differentiate between single linked list and double linked list.

B) Define circular linked list. 9. A) Define Queues with examples.

B) Differentiate between rear and front end. 10. A) what is tree? Describe it with examples.

B) Differentiate among pre-order, post-order and in- order. 11. Write short notes on any two of the following:

A) AVL tree B) Binary tree C) complete tree

2014

D) Queues

Group A

2. A) what is database? Explain the benefits of a database?

B) Explain different types of data language. 3. A) what do you understand by DBA and how they play an important role?

B) Differentiate between instances and schemes? 4. A) what do understand by data integrity constraints and data abstraction?

B) What is hashing? Explain different types of hashing. 5. Write SQL statements for the following:

Student (name, roll_no, gender, phone_no)

I) To create table II) Insert row in table III) Display the value IV) Drop the table

6. Write short notes on any two of the following:

A) Database manager B) boyce–codd normal from C) relation algebra

D) Functional dependency E) Query processor

Group B

7. A) What is an array? What are the limitations of an array?

B) Sort following data set using bubble sort. Show all steps in

details: 55,45,37,24,56,32,28. 8. Write a menu driven program in ‘C’ which performs the following operation on strings:

I) Check if one string is substring of another. II) Count the length of string. III) Exit

9. A) Explain selections sort techniques with an example.

B) Write a C program to create and display singly circular linked list. 10. A) write a function to insert elements in a Binary search tree.

B) Differentiate recursion and iteration with examples. 11. Write short notes on any two of the following: I) Double linked list III) Circular queue II) Stack IV) Non – linear data structures 2015

Group A

2. A) Explain the DBMS with suitable example.

B) Define schema. Describe different types of schema. 3. A) what is aggregation? Explain with examples.

B) Differentiate between instances and schemas? 4. A) what are the drawbacks of RDBMS?

B) What do you mean by normalization? Describe 1NF and 2NF with examples. 5. What is data model? Explain the different types of the data model with examples. 6. A) Write short notes on following

I) BCNF II) Tuple III) Entity

B) Explain the drawbacks of the system.

Group B

7. A) What is recursion? Explain with examples.

B) What is Binary tree? Define the different properties of Binary tree. 8. A) Explain the stack and queue with examples.

B) Differentiate between single linked list and doubly linked list. 9. A) Write a program to multiply two matrices.

B) Write a function to sort the element of a single linked list. 10. A) Write a function in ‘C’ for quick sort methods.

B) Write the function for Binary search iterative. 11. Write sort notes on any three of the following.

A) Array B) AVL tree C) Queue D) data structures

2016

Group A

2. A) What the difference between file systems and DBMS? Discuss the advantages and disadvantages of DBMS.

B) Discuss the structure of DBMS. 3. A) Discuss generalization and specialization with suitable example.

B) What do you mean by DML? Explain all commands of DML with their SQL structure. 4. A) What are views? Describe different types of views.

B) Discuss briefly network and hierarchical data model. 5. A) What E-R diagram? Explain it with the help of example.

B) Write SQL statement for the following.

Book (book_name, book_name, price)

I) To create table II) Insert a row in the table

III) Update book name ‘ABC ‘to ‘xyz ‘. 6. Explain any four of the following.

I) Super key II) Candidate key III) Database manager IV) Data dictionary

V) DBA VI) Specialization VII) Constraints VIII) Attributes

Group B

7. A) Write the function of selection sort techniques.

B) Sort following data set using bubbles sort. Show all the steps in

detail: 40,28,22,11,42,20,35 8. A) Differentiate between array and singly linked list.

B) Write a function to insert an element before a given element in a single linked list. 9. A) What is stack? Explain the different operations performed on stack.

B) Write a program to reverse the element of a stack using two temporary stacks. 10. A) Convert the following postfix expression into infix.

I) AB*C+E* II) AB+C/D*E- III) ABC /+DE*F+- IV) AB – C –D*

Also draw the expression tree for each of the expression.

B) Insert following elements in an AVL tree showing various steps of insertion and

rotation 44, 39,65,83,21,35,37,20 11. Write short notes on any four of the following:

A) Dynamic data structure B) strictly Binary tree C) Binary tree

D) Tree E) double linked list F) non – linear data structures

G) Circular queue H) linked list. 2017

Group A

1. Compare and contrast relational, network and hierarchical DBMS.

2. What is ER Diagram ? Draw an ER Diagram for Hospital Management System.

3. What do you mean by join operation ? Explain different types of join operation by taking examples.

4. What is aggregation ? Explain by taking example.

5. What are pros and cons RDBMS ? Explain with examples.

Group B

1. What is array ? Explain different types of array with example.

2. What do you mean by recursion ? How it is different than looping ?

3. Write a program to search for an element in a Binary Serach Tree.

4. What is queue ? Explain different types of operations performed on a queue.

5. Explain difference between linear and non-linear data structure.

www.acharyainstitution.com