RTU Previous Exam Papers BE CS 5th Semester
Data Base Management System December-2011
1 (a) Describe different Data Base Schemes in detail and also explain the difference between physical and logical Data Independence.
(b) Describe the five components of DBMS environment and discuss how they relate to each other.
1. Generate an E-R digram for Bank enterprise which has following major characteristics :
(i) The bank is organized into branches, located in a city and has a unique name. It monitors the Asset value.
(ii) Bank customers are identified by their customer-id values. Customers have accounts and take out loan. He/She is associated with a particular Banker, who may act as a loan officer or Personal Banker for that customer.
(iii) Bank employees are identified by their employee-id values. The bank also keeps packs of the employee’s start date and thus length of employeement.
(iv) The Bank offers two account Saving and Banking account. Account can be held by more than one customer and a customer has more than one account.
(v) A loan is originated at a particular branch and can be held by one or more customers. The Data and Time are recorded for each payment.
UNIT – II
2 (a) How does Tuple Relational Calculus differ from Domain Relational Calculus.
(b) Differentiate between Degree and Cardinality of a relation.
2 Write short notes on the following :
(i) Internet Data Base
(ii) Object Oriented Data Base System
(iii) Integrity constraints
(iv) Join Dependency
(v) Multivalued Dependencies.
UNIT – III
3 (a) What is normalization ? How is it useful in a good Data Base Design ?
(b) Discuss the purpose of BCNF and describe how BCNF different from 3NF. Provide an example to illustrate your answer.
3 What do you mean by serializability ? Discuss the conflict and view serializability with suitable example. Discuss the testing of serializability also.
UNIT – IV
4 What is log ? How is it maintained ? Discuss the salient features of deferred DataBase modification and immediate DataBase modification strategies in brief.
4 What is Recoverable schedule ? Why is recoverability of schedule desirable ? Are there any circumstances, under which it would be desirable to allow non-recover able schedule ?
UNIT – V
5 Construct a B+ tree for the following set of key value (2, 3, 5, 7, 11, 17, 19, 23, 29, 31). Assume that the tree is initially empty and values are added in ascending order. Construct B+ trees for the cases where the number of pointers that will fit in one node is as follows :
(a) What is the difference between a clustering index and a secondary index ?
(b) Describe Static and Dynamic Hashing.