Anna University Questions with Answers - CS6302 Database Management Systems April May 2017, Computer Science and Engineering, Information Technology Questions, Third semester, fifth, and eighth semester, Regulation 2013
CS6302 Database Management Systems for B.E. Computer Science and Engineering
CS6302 Database Management Systems for B.Tech. Information Technology
CS6302 Database Management Systems for B.E. Mechanical and Automation Engineering
|
Exam |
B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS |
|
Academic Year |
April May 2018 |
|
Subject Code |
CS6302 |
|
Subject Name |
Database Management Systems |
|
Branch |
Computer Science and Engineering |
|
Semester |
Third / Fifth / Eighth Semester |
|
Regulation |
2013 |
Question Paper Code : 40901
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2018
Third/Fifth/Eighth Semester
Computer Science and Engineering
CS 6302 — DATABASE MANAGEMENT SYSTEMS
(Common to Mechanical and Automation Engineering, Mechatronics Engineering, Information Technology)
(Regulation 2013)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A — (10 × 2 = 20 marks)
1. What is weak entity? Give example.
2. Define a foreign key. Give example.
3. What is data definition language? Give example.
4. Outline the steps involved in query processing.
5. What is serializability?
6. State the difference between a shared lock and an exclusive lock.
7. What is hash function? Give example.
8. Define data mining.
9. What is a distributed database management system?
10. State the difference between classification and clustering.
PART B — (5 × 13 = 65 marks)
11. (a) Explain select, project, Cartesian product, and join operations in relational algebra with an example.
OR
(b) What is database normalization? Explain first normal form, second normal form, and third normal form with an example.
12. (a) Explain the aggregate functions in SQL with example.
OR
(b) What is query optimization? Outline the steps in query optimization.
13. (a) i) During 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? (6)
ii) Explain with an example the properties that must be satisfied by a transaction. (7)
OR
(b) i) What is concurrency control? Explain the two-phase locking protocol with an example. (7)
ii) Explain conflict serializability and view serializability. (6)
14. (a) What is hashing? Explain static hashing and dynamic hashing with an example.
OR
(b) Outline the features of the following databases:
i) Parallel databases (7)
ii) Multimedia databases (6)
15. (a) i) Present an overview of database security. (8)
ii) Explain with diagrammatic illustration the architecture of a distributed database management system. (5)
OR
(b) Explain the necessary characteristics a system must satisfy to be considered as an object oriented database management system.
PART C is skipped here.
*****************************
Go to Previous year University Exam Questions page.
No comments:
Post a Comment