Thursday, February 18, 2016

Anna University CS1301 DBMS Question papers November December 2006

CS1301 Database Management Systems question paper - Nov-Dec 2006 / Anna University Previous Year Exam Questions / Anna University Previous Year Computer Science and Information Technology Question Papers / Anna University Previous Year CS1301 DBMS Exam Questions under Regulation 2004




B.E./B.Tech. DEGREE EXAMINATION, NOV/DEC 2006
Fifth Semester
Computer Science and Engineering
CS 1301 — DATABASE MANAGEMENT SYSTEMS
 (Regulation 2004)
Time: Three hours                                                              Maximum: 100 Marks
Answer ALL Questions
PART A — (10 × 2 = 20 Marks)
1. Compare database systems with file systems.
2. Give the distinction between primary key, candidate key and super key.
3. Write a SQL statement to find the names and loan numbers of all customers who have a loan at Chennai branch.
4. What is multi-valued dependency?
5. Give the measures of the quality of the disk.
6. What are the two types of ordered indices?
7. List out the ACID properties.
8. What is shadow paging?
9. Compare DBMS versus object oriented DBMS.
10. What is Data warehousing?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Describe the system structure of database system. (12)
(ii) List out the functions of DBA (4)
Or
(b) (i) Illustrate the issues to be considered while developing an ER-diagram. (8)
(ii) Consider the relational database
Employee (empname, street, city)
Works (empname, companyname, salary)
Company (companyname, city)
Manages (empname, managername).
Give an expression in the relational algebra for each request.
Find the names of all employees who work for first bank Corporation.
Find the names, street addresses and cities of residence of all employees who work for first bank corporation and earn more than 200000 per annum.
Find the names of all employees in this database who live in the same city as the company for which they work.
Find the names of all employees who earn more than every Employees of small Bank Corporation. (4 * 2 = 8)
12. (a) (i) Discuss about triggers. How do triggers offer a powerful mechanism for dealing with the changes to database with suitable example? (10)
(ii) What are nested queries? Explain with example. (6)
Or
(b) (i) What is normalization? Give the various normal forms of relational schema and define a relation which is in BCNF and explain with suitable example. (12)
(ii)Compare BCNF versus 3NF. (4)
13. (a) (i) Describe about RAID levels. (10)
(ii) Explain why allocations of records to blocks affects database system performance significantly. (6)
Or
(b) (i) Describe the structure of B+ tree and give the algorithm for search in the B+ tree with example. (12)
(ii) Give the comparison between ordered indexing and hashing
14. (a) (i) Explain the different forms of Serializability. (10)
(ii) What are different types of schedules are acceptable for recoverability? (6)
Or
(b) (i) Discuss on two-phase locking protocol and timestamp-based protocol. (12)
(ii) Write short notes on log-based recovery. (4)
15. (a) (i) Discuss in detail about the object relational database and its advantages. (8)
(ii) Illustrate the issues to implement distributed database. (8)
Or
(b) (i) Give the basic structure of XML and its document schema. (8)
(ii) What are the two important classes of data mining problems? Explain about rule discovery using those classes. (8)

*******************

Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents

data recovery