Thursday, 18 February 2016

Anna University CS1301 DBMS Question papers May June 2009

CS1301 Database Management Systems question paper - May-June 2009 / 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, MAY/JUNE 2009
Fifth Semester
Computer Science and Engineering
CS 1301 — DATABASE MANAGEMENT SYSTEMS

Time: Three hours                                                              Maximum: 100 Marks
Answer ALL Questions
PART A — (10 × 2 = 20 Marks)
1. With a relevant example explain Ternary Relationship.
2. Define the term Primary key. Give example.
3. Consider the following relation:
EMP (Eno, Name, Date_Of_Birth, Sex, Date_Of_Joining, Basic_Pay, Dept)
Develop an SQL query that will find and display the Dept
Develop an SQL query that will find and display the Dept and Average Basic_Pay in each Dept.
4. With an example explain a Functional Dependency.
5. What are Ordered Indices?
6. Distinguish between Spare Index and Dense Index.
7. State the Atomicity property of a Transaction.
8. List the SQL statements used for Transaction Control.
9. What is a Nested Relation?
10. Define A Distributed Database Management System.

PART B — (5 × 16 = 80 Marks)

11. (a) Perform a Comparative Study between the Hierarchical Data Model and Network Data Model.
Or
(b) Develop an Entity Relationship model for a Library Management System. Clearly state the problem Definition, Description, Business Rules and any Assumptions you make.

12. (a) Consider the following relations for a company Database Application:
Employee (Eno, Name, Sex, Dob, Doj, Designation, Basic_Pay, Dept_No)
Department (Dept No, Name)
Project (Proj No, Name, Dept_No)
Worksfor (Eno, Proj No, Date, Hours)
The attributes specified for each relation is self-explanatory. However the business rules are stated as follows. A department can control a project. An employee can work on any number of projects on day. However an employee cannot work more than once on a project he/she worked on that day. The primary keys are underlined.
(i) Identify the foreign keys. Develop DDL to implement the above schema.
(ii) Develop an SQL query to list the department number and the number of employees in each department.
(iii) Develop a View that will keep track of the department number, the number of employees in the department, and the total basic pay expenditure for each department.
(iv) Develop an SQL query to list the details of employees who have worked in more than three projects on a day.
Or
(b) With relevant examples discuss First Normal Form, Second Normal Form, Third Normal Form and BCNF.
13. (a) Construct a B+ - tree for the following set of key values:
(2,3,6,9,12,18,19,23,29,31,40,67,90,110)
Assume that the tree is initially empty and values are added in ascending order. Note: The number of pointers that will fit in one node is three. Illustrate the tree construction process step by step.
Or
(b) (i) Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.
(ii)What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflow? Discuss.
14. (a) (i) With relevant example discuss Two Phase Locking.
(ii)What is Deadlock? List and discuss the four conditions for Deadlock.
Or
(b) Why is Recovery needed? Discuss any two Recovery Techniques.
15. (a) Describe the necessary characteristics that a system must satisfy to be considered an Object Oriented Database Management System.
Or
(b) Diagrammatically illustrate and discuss the steps involved in the knowledge Discovery Process (Knowledge Discovery from Databases).

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

Simple introduction to Naive Bayes classifier

Simple introduction to Naive Bayes classifier What is Naive Bayes Classifier? A Naive Bayes classifier is a probabilistic classifier ...