Code: R5 210506

R5
DATABASE MANAGEMENT SYSTEMS
(Common to CSE, IT and CSS)

B.Tech II Year I Semester (R05) Supplementary Examinations, May 2012

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a)

Max Marks: 80

(b)

Design an ER diagram for an IT training group database that will meet the information needs for its training program. Clearly indicate the entities, relationships and the key constraints. The description of the environment is as follows: The company has 12 instructors and can handle up to 100 trainees for each training session. The offers 5 Advanced technology courses, each of which is taught by a team of 2 or more instructors each instructor is assigned to a maximum of two teaching teams or may be assigned to do research each trainee undertakes one advanced technology course per training session. What is the need for evaluation of a DBMS? List the technical criteria that are to be considered during the evaluation process. Explain Domain relational calculus with example. And state the difference between this and tuple relational calculus. Explain the basic relational algebra operations with the symbol used and an example for each. What Aggregate operators does SQL support? Briefly describe it. Discuss the strengths and weaknesses of the trigger mechanism. Contrast triggers with other integrity constraints support by SQL. Define the term functional dependency. Give a set of FDs for the relation schema R (A, B, C, D) with primary key AB under which R in 1 NF but not in 2 NF. What do you mean by BCNF? Why it is used and how it differ from 3 NF? What are the ACID properties? IIustrate them with examples. Explain about lock based concurrency control. Contd. in Page 2 Page 1 of 2

(a) (b)

(a) (b)

(a) (b)

(a) (b)

Code: R5 210506 6 (a)

R5

(b)

Explain the recovery process of a checkpoint mechanism. How does the frequency of checkpoints affect. (i) System performance when no failures occurs. (ii) The time it takes to recover from a system crash. What is the need of a log in a DBMS? Briefly describe the various types of records that are normally present in a log. Suppose there is a hash function h (x) = x mod 8. Show that hash structure for a file with the following key values 2,5,7,26,13,20,38,40,50,18,74,. Assume a bucket size of 2 records. How is data organized in a tree-based index? Explain briefly. Construct a B+ tree for the following set of key values under the assumption that the number key values that fit in a node is 3. Key values (3,10,12,14,29,38,45,55,60,68,). Show the steps involved in the following insertions (use your algorithm) Insert 11, insert 30.

(a)

(b) 8

*****

Page 2 of 2