University question paper of Database management systems for second year engineering students. This DBMS May/June 2012 question paper is common to all CSE and IT students. Students can download this question paper for free of cost.
Question Paper Code : 10267
B.E/B.Tech. DEGREE EXAMINATION, MAY/JUNE 2012
Computer Science and Engineering
CS 2255/141405/CS 46/CS 1254/10144 CS 406/080250009 – DATABASE MANAGEMENT SYSTEMS
(Common to Information Technology)
Time : Three Hours Maximum: 100 marks
Answer ALL questions.
PART A – ( 10 x 2 = 20 marks )
1. List four significant differences between a file-processing system and a DBMS.
2. What are the different types of Data Models?
3. Describe a circumstance in which you would choose to use embedded SQL rather than using SQL alone.
4. List two major problems with processing of update operations expressed in terms of views.
5. Give an example of a relation schema R and a set of dependencies such that R is in BCNF, but not in 4NF.
6. Why are certain functional dependencies called as trivial functional dependencies?
7. List down the SQL facilities for concurrency.
8. What benefit does strict two-phase locking provide? What disadvantages result?
9. Mention the different Hashing techniques.
10. When is it preferable to use a dense index rather than a spare index? Explain your answer.
PART – B (5 x 16 = 80 marks )
11. (a) Discuss in detail about database system architecture with neat diagram.
(b) Draw an E-R diagram for a banking enterprise with almost all components and explain.
12. (a) Explain in detail about Relational Algebra, Domain Relational Calculus and Tuple Relational Calculus with suitable examples.
(b) Briefly present a survey on Integrity and Security.
13. (a) Explain in detail about 1NF, 2NF, 3NF and BCNF with suitable examples.
(b) Describe about the Multi-Valued Dependencies and Fourth normal form with suitable example.
14. (a) Discuss in detail about Transaction Recovery, System Recovery and Media Recovery.
(b) Write down in detail about Deadlock and Serializability.
15. (a) Construct a B+ tree to insert the following key elements (order of the tree is 3)
5, 3, 4, 9, 7, 15, 14, 21, 22, 23.
(b) Describe in detail about how records are represented in a file and how to organize them in a file.