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)

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

Anna University MCA MC 1654 – DATABASE MANAGEMENT SYSTEMS Question May June 2006

MC 1654 – Database Management Systems - May June 2006 Question Paper / Anna University MCA Exam May June 2006 Question Paper / MC1654 DBMS May June 2006 Question Paper / MC1654 Database Management Systems Previous Year MCA Question Paper / Anna University Affiliated Colleges MCA Question Papers / MC1654 DBMS Regulation 2005 MCA Question Paper / MCA Second Semester Question Paper

Question Paper Code :

M.C.A DEGREE EXAMINATION, MAY/JUNE 2006

MC 1654 – DATABASE MANAGEMENT SYSTEMS

(Regulation 2005)

Time : Three Hours                                                         Maximum : 100 marks

Answer ALL Questions

PART A – (10 X 2 = 20 marks)

1. Define the terms super key and candidate key.

2. List the components and responsibilities of the storage component manager?

3. How can you express queries in Query By Examples (QBE)?

4. Define the terms Authentication and Authorization.

5. What do you mean by RAID? Mention its significance.

6. Distinguish between Static hashing and Dynamic hashing.

7. List the operations involved in query processing?

8. Discuss about pipelining.

9. What are the different states of a transaction? Explain.

10. What is the purpose of check point mechanism?

PART B – (5 X 16 = 80 marks)

11. (a) Explain the design of Entity Relationship diagram with a suitable example.

Or

(b) Discuss the responsibility of DBA.

12. (a) (i)Discuss the various set operations that operate on a relation with suitable example.

(ii) Discuss the different types of joins in queries.

Or

(b) Explain about integrity constraints in database with examples.

13. (a) Discuss on how Hashing technique overcomes drawbacks in Sequential File  Organization.

Or

(b) Discuss about how file organization is implemented using B+ tree?

14. (a) Explain the various issues to be considered in the Evaluation of expressions with proper illustration.

Or

(b) Write down the procedure to perform Heuristics Optimization and explain.

15. (a) (i) Explain conflict serialization with example.

(ii) Explain shadow paging conflict.

Or

(b) (i) Write short notes on Data Dictionary.

(ii) Write short notes on Buffer Management.

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

                                            

Differentiate between dense index and sparse index

Differentiate between dense and sparse indexes - Dense index - Sparse index - Difference between sparse and dense index

Dense index VS Sparse index

	Dense Index	Sparse Index
Index size	Larger	Smaller
Records in data file	Need not be clustered	Need to be Clustered
Time to locate data	Less	More
Computing time in RAM	Less	More
Overhead for insertions and deletions	More	Less
Data pointers pointing to	Each record in the data file	Fewer records in the data file

Anna University MCA MC 1654 – DATABASE MANAGEMENT SYSTEMS Question November December 2006

MC 1654 – Database Management Systems - November December 2006 Question Paper / Anna University MCA Exam November December 2006 Question Paper / MC1654 DBMS November December 2006 Question Paper / MC1654 Database Management Systems Previous Year MCA Question Paper / Anna University Affiliated Colleges MCA Question Papers / MC1654 DBMS Regulation 2005 MCA Question Paper / MCA Second Semester Question Paper

Question Paper Code :

M.C.A DEGREE EXAMINATION, NOV/DEC 2006

MC 1654 – DATABASE MANAGEMENT SYSTEMS

(Regulation 2005)

Time : Three Hours                                                         Maximum : 100 marks

Answer ALL Questions

PART A – (10 X 2 = 20 marks)

1. How is the database management system indispensable in data handling?

2. What is semantic data model?

3. What are integrity constraints in relational model?

4. What is the use of Embedded SQL?

5. Define hash based indexing in data storage operations.

6. What are composite search keys? Explain with a example.

7. What do you meant by query optimization?

8. What does a query evaluation plan consists of?

9. State the purpose of locking protocols in DBMS.

10. What are the two important functions of Recovery Management?

PART B – (5 X 16 = 80 marks)

11. (a) (i) Narrate the advantage of DBMS systems.

(ii) Discuss the steps involved in the design of database systems.

Or

(b) (i) Illustrate the concept of relationships and relationship sets in Entity Relationship (ER) model with a suitable example.

(ii) Elaborate on the key constraint construct in ER models with an example.

12. (a) (i) What is the use of cursors in embedded SQL? Specify the basic cursor definition format, giving illustrative examples.

(ii) Give an example of foreign key constraints in relational models and develop an SQL statement for the same.

Or

(b) How is the Relational Model designed based on the ER models? Discuss with respect to the issues of tables, relationship without constraints and key constraints?

13. (a) Explain the mechanism of hash based indexing with an example.

Or

(b) Describe the various levels of RAID systems in detail.

14. (a) Explain the working of Query Optimizer with a block diagram.

Or

(b) Discuss the issues in implementing optimization strategies for the JOIN queries.

15. (a) What is the role of COMMIT, ROLLBACK and SAVEPOINT SQL statements in transaction management?

Or

15. (b) Write short notes on Buffer Management.

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