Reg. No.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Fourth Semester
Computer Science and Engineering
01UCS405 DATABASE MANAGEMENT SYSTEMS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks)
1. Why some functional dependencies are called trivial?
2. What is Weak Entity? Give an example.
3. Give the general form of SQL Query.
4. Define Query Optimization.
5. How does the recovery manager ensure atomicity of transactions? How does it ensure durability?
6. Justify the need for Concurrency control.
7. What is the need for dynamic hashing?
8. State the advantage of replicating data in a distributed database environment.
9. What are the goals of data mining?
10. What is meant by Association rule?
PART B x 16 80 Marks)
11. Define a functional dependency. List and discuss the six inference rules for functional dependencies. Give relevant examples.
Question Paper Code: 31245
2
31245
Or Describe the architecture of Database system with a neat sketch.
12. What are the basic steps in query processing? Illustrate your answer with a suitable diagram. Or Explain in detail about query optimization.
13. During its execution, a transaction passes through several states, until it finally commits or aborts. List all possible sequences of states through which a transaction may pass. Explain why each state transition may occur. Or Illustrate the concepts of deadlock prevention techniques.
14. Explain the various levels in RAID with advantages and disadvantages. Or Write detailed notes on mobile and web databases.
15. List and discuss the different issues related to database security. Or
Explain in detail the steps involved in the process of knowledge discovery from databases.