CS 1234 — DATABASE MANAGEMENT SYSTEM QUESTION PAPER

ANNA UNIVERSITY :: CHENNAI - 600 025
MODEL QUESTION PAPER(V-SEMESTER)

CS 1234 — DATABASE MANAGEMENT SYSTEM
PART A — (10 × 2 = 20 marks)
1. Distinguish between physical and logical data independence.
2. What is a data dictionary? What are the informations stored in the data dictionary?
3. What is a view and how is it created? Explain with an example.
4. In what way is an Embedded SQL different from SQL? Discuss.
5. Which condition is called referential integrity? Explain its basic concepts.
6. Explain with a simple example, the lossless–join decomposition.
7. How to choose the best evaluation plan for a query? Explain.
8. What is a timestamp–ordering scheme? Specify two simple methods for
implementing this scheme.
9. Give a comparison of object–oriented and object–relational databases.
10. Which are the two models used for discovering rules from database? Give the
general form of rules to express knowledge.
PART B — (5 × 16 = 80 marks)
11. (i) What are data models and how are they grouped?
(ii) Explain in detail any two data models with sample databases.
12. (a) (i) Discuss the fundamental operations in the relational algebra.
(ii) For each operation give an example.
Or
(b) (i) SQL language has several parts. What are they?
(ii) How many clauses are there in the basic structure of an SQL? Explain.
13. (a) (i) Discuss the various pitfalls in a relational database design using a
sample database.
(ii) Explain at least two of the desirable properties of decomposition.
Or
(b) (i) What are the merits and demerits of a B+ tree index structure?
(ii) Describe the structure of a B+ tree.

FEEL USEFUL PLEASE GIVE +1