CS2255 Database Management Systems question paper - Apr/May 2010

CS2255 Database Management Systems question paper - Apr/May 2010 / Anna University Previous Year Exam Questions / Anna University Previous Year Computer Science and Information Technology Question Papers

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010

Fourth Semester

Computer Science and Engineering

CS2255 — DATABASE MANAGEMENT SYSTEMS

(Common to Information Technology)

(Regulation 2008)

Time: Three hours Maximum: 100 Marks

Answer ALL Questions

PART A — (10 × 2 = 20 Marks)

1. Explain the basic structure of a relational database with an example.
2. What are the functions of a DBA?
3. Give the usage of the rename operation with an example.
4. What do you mean by weak entity set?
5. What is normalization?
6. Write a note on functional dependencies.
7. What do you mean by a transaction?
8. Define the term ACID properties.
9. Describe flash memory.
10. List out the physical storage media.

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Discuss the various disadvantages in the file system and explain
how it can be overcome by the database system. (6)
(ii) What are the different Data models present? Explain in detail. (10)
 

OR
 

(b) (i) Explain the Database system structure with a neat diagram. (10)
(ii) Construct an ER diagram for an employee payroll system. (6)
12. (a) (i) Explain the use of trigger with your own example. (8)
(ii) Discuss the terms Distributed databases and client/server
databases. (8)
 

OR

 
(b) (i) What is a view? How can it be created? Explain with an example. (7)
(ii) Discuss in detail the operators SELECT, PROJECT, UNION with
suitable examples. (9)
13. (a) Explain 1NF, 2NF and 3NF with an example. (16)
 

OR
 

(b) Explain the Boyce-Codd normal form with an example. Also state how it
differs from that of 3NF. (16)
14. (a) (i) How can you implement atomicity in transactions? Explain. (8)
(ii) Describe the concept of serilalizability with suitable example. (8)
 

OR
 

(b) How concurrency is performed? Explain the protocol that is used to
maintain the concurrency concept. (16)
15. (a) What is RAID? Explain it in detail. (16)
 

OR
 

(b) Mention the purpose of indexing. How this can be done by B+ tree?
Explain. (16)

_____________________________

 

CS2255 Database Management Systems question paper

CS2255 Database Management Systems question paper - Nov/Dec 2010 / Anna University Previous Year Exam Questions / Anna University Previous Year Computer Science and Information Technology Question Papers

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

Fourth Semester

Computer Science and Engineering

CS 2255 — DATABASE MANAGEMENT SYSTEMS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours Maximum : 100 Marks

Answer ALL questions

PART A — (10 × 2 = 20 Marks)

1. Define the two levels of data independence.

2. Write down any two major responsibilities of a database administrator.
3. List out the various relational algebra operators.
4. What are the four broad categories of constraints?
5. Define irreducible sets of dependencies.
6. Define the third normal form.
7. What are ACID properties?
8. What are the three kinds of intent locks?
9. Which are the factors to be considered for the evaluation of indexing and
hashing techniques?
10. What is the drawback of flash memory?

PART B — (5 × 16 = 80 Marks)

11. (a) Explain the three different groups of data models with examples. (16)
 
OR
 
(b) Describe the components of entity-relationship diagram with suitable examples. (16)
12. (a) Describe the features of Embedded SQL and Dynamic SQL. Give suitable examples. (16)
 
OR
 
(b) Write short notes on the following :
(i) Mandatory access control. (9)
(ii) Missing information. (7)
13. (a) Explain non loss decomposition and functional dependencies with
suitable example. (16)
 
OR
 
(b) Discuss Join Dependencies and Fifth Normal Form, and explain why
5NF? (16)
14. (a) (i) State the Two-Phase Commit protocol. Discuss the implications of a
failure of the coordinator and some participants. (10)
(ii) Briefly explain transaction recovery with primitive operations. (6)
 
OR
 
(b) (i) State and explain the three concurrency problems. (9)
(ii) What is meant by isolation level and define the five different
isolation levels. (7)
15. (a) (i) Discuss the improvement of reliability and performance of RAID (8)
(ii) Explain the structure of a B+-tree. (8)
 
OR
 
(b) Explain the complex selection predicates with example. (16)

_____________________________