Wednesday, October 28, 2009
| IF 254 -DATA BASE MANAGEMENT SYSTEM |
| PART A — (10 * 2 = 20 marks) |
| 1. Define Data Base Management System. |
| 2. Name the different types of attributes that occur in the ER model. |
| 3. What is the difference between a key and a superkey? |
| 4. Explain functional dependency. |
| 5. Mention the advantages of Distributed DBMS. |
| 6. What is a fully inverted file and indexed sequential file? |
| 7. What is a set type? How are the set instances of a set type identified? |
| 8. What is an occurrence tree of a hierarchy? |
| 9. Define Object oriented database. |
| 10. Mention some applications of data mining. |
| PART B — (5 * 16 = 80 marks) |
| 11. (i) List the operations of the relational algebra and explain with suitable examples. |
| (10) |
| (ii) Discuss the various types of constraints that can be specified on a relational data base |
| schema. (6) |
| 12. (a) (i) Draw the three schema architecture of data base systems and explain in detail. |
| (10) |
| (ii) Compare logical data independence and physical data independence. (6) |
| Or |
| (b) (i) Explain nested queries with suitable examples. (9) |
| (ii) Discuss the substring comparisons, arithmetic operators and ordering features of SQL. |
| (7) |
| 13. (a) Discuss the process of normalization used in designing a data base system. Explain |
| the various normal forms for relation schemas. |
| Or |
| (b) Discuss the following two types of hashing techniques that allow dynamic file |
| expansion :(i) Dynamic hashing. (8) |
| (ii) Extendible hashing. (8) |
| 14. (a) What are the different types of ordered indexes for the files? Explain any two |
| types in detail giving the block diagrams that explain the indexing structure. |
| Or |
| (b) (i) Using an example data base schema, explain the data definition in the network |
| model. (10) |
| (ii) How a conceptual data base design specified as an ER schema can be mapped to a |
| network schema? (6) |
| 15. (a) Explain the following with respect to a Hierarchical data base model : |
| (i) Data base structure |
| (ii) Virtual Parent–child relationships |
| (iii) Integrity constraints |
| (iv) Data Definition Language. (4 * 4 = 16) |
| Or |
| (b) Write detailed note on the following : |
| (i) Data warehousing and data mining. (8) |
| (ii) Temporal data bases and multimedia data bases. (8) |
http://www.ziddu.com/download/7201277/dbms1.pdf.html



