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).

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

Anna University CS1301 DBMS Question papers April May 2008

CS1301 Database Management Systems question paper - Apr-May 2008 / 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, APR/MAY 2008

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. Define Data independence.

2. Distinguish between primary key and candidate key

3. With an example explain a weak entity in an ER diagram.

4. With an example explain referential integrity.

5. What is domain integrity? Give example.

6. Distinguish between dense and sparse indices.

7. List the properties that must be satisfied by a transaction,

8. Define deadlock.

9. State the advantages of distributed systems.

10. What is data warehousing?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Construct an ER diagram for a car insurance company that has a set of customers, each of whom owns one/more cars. Each car has associated with it zero to any number of recorded accidents. (8)

(ii) Construct appropriate tables for the above ER diagram. (8)

Or

(b) (i) Define data model. Explain the different types of data models with relevant examples. (10)

(ii) Explain the role and functions of the database administrator. (6)

12 (a) With relevant examples discuss the following in SQL.

(i) Data Definition Language. (4)

(ii) Data Manipulation Language (4)

(iii) Data Control Language (4)

(iv) Views (4)

Or

(b) What is normalization? Explain normalization techniques using functional dependencies with relevant examples. (16)

13 (a) Explain following with relevant examples:

(i) B tree (5)

(ii) B+ tree (5)

(iii) Static and dynamic hashing (6)

Or

(b) With a relevant example discuss the steps involved in processing a query. (16)

14 (a) Explain testing for serializability with respect to concurrency control schemes. How will you determine whether a schedule is serializable or not? (16)

Or

(b) Explain the following concurrency control:

(i) Lock based protocol (8)

(ii) Time stamp based protocol (8)

15 (a) State and explain the object oriented data model. Use banking application as an example. (16)

Or

(b) Write detail notes on following:

(i) Distributed Databases (8)

(ii) Data Mining (8)

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

 

Anna University CS1301 DBMS Question papers November December 2008

CS1301 Database Management Systems question paper - Nov-Dec 2008 / 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 2008

Fifth Semester

Computer Science and Engineering

CS 1301 — DATABASE MANAGEMENT SYSTEMS

(Common to B.E.(PART-TIME) Fourth Semester REGULATION 2005)

(Regulation 2004)

Time: Three hours                                                              Maximum: 100 Marks

Answer ALL Questions

PART A — (10 × 2 = 20 Marks)

1. What is Database management system? Why do we need DBMS?

2. What are the three characteristics of a Relational Database system?

3. State the differences between security and integrity.

4. What is decomposition and how does it address redundancy?

5. What is a heap file? How are pages organized in a heap file?

6. How does a B-tree differ from a B+ tree? Why is B+ tree usually preferred as an access structure to a data file?

7. Give the meaning of the expression ACID transition.

8. When are two schedules conflict equivalent?

9. Define the terms fragmentation and replication, in terms of where data is stored.

10. What are structured data types? What are collection types, in particular?

PART B — (5 × 16 = 80 Marks)

11(a) (i) Explain the component modules of a DBMS and their interactions with the architecture. [10]

(ii) Construct an ER diagram to a model online book store. [6]

Or

(b) (i) Explain the basic Relational Algebra operations with the symbol used and an example for each.[10]

(ii) Discuss about Tuple Relational calculus and Domain Relational Calculus. [6]

12 (a) (i) Write short notes on the following: [10]

Data Manipulation Language (DML)

Data Definition Language (DDL)

Transaction Control Statements (TCS)

Data Control Language (DCL)

Data Administration Statements (DAS).

(ii) Consider the database given by the following schemas:[6]

Customer(Cust_No,Sales_Person_No,City)

Sales_Person(Sales_Person_No,Sales_Person_Name,Common_Prec,Year_of_Hire)

Give an expression in SQL for each of the following queries:

Display the list of all customers by Cust_No with the city in which each is located.

List the names of the sales persons who have accounts in Delhi.

Or

(b) (i) Consider the universal relation R(A,B,C,D,E,F,G,H,I,J) and the set of FD's.

G=({A,B}->{C}->{B,D}->{E,F},{A,D}->{G,H},{A}->{I},{H}->{J}) what is the key of R?

Decompose R into 2NF, then 3NF relations. [10]

(ii) Discuss how schema refinement through dependency analysis and normalization can improve schemas obtained through ER design. [6]

13 (a) (i) Describe the different types pf file organization? Explain using a sketch of each of them with their advantages and disadvantages. [10]

(ii) Describe static hashing and dynamic hashing. [6]

Or

(b) (i) Explain the index schemas used in database systems.[10]

(ii) How does a DBMS represent a relational query evaluation plan? [6]

14 (a) (i) Explain Timestamp-Based Concurrency Control protocol and the modifications implemented in it. [10]

(ii) Describe shadow paging recovery technique. [6]

Or

(b) (i) Describe Strict Two-phase Locking protocol.[10]

(ii) Explain Log based recovery technique. [6]

15 (a) (i) Explain 2-phase commitment protocol and the behaviour of this protocol during lost messages and site failures. [12]

(ii) Describe X path and X query with an example.[4]

Or

(b) (i) Explain Data Mining and Data Warehousing.[12]

(ii) Describe the anatomy of XML document. [4]

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