Jawaharlal Nehru Technological University Hyderabad 2009-2nd Sem B.Tech Information Technology , Code No: 07A4EC14 Set No.3 II Regular s, / DATA BASE MANAGEMENT SYSTEMS ( Common to Computer

Code No: 07A4EC14 Set No. 3
II B.Tech II Semester Regular Examinations, Apr/May 2009
DATA BASE MANAGEMENT SYSTEMS
( Common to Computer Science & Engineering and info
Technology)
Time: three hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
? ? ? ? ?
1. (a) Why would select a database system instead of simply storing data in oper-
ating system files ? When would it make sense not to use a database system?
(b) What is logical data independence and why is it important? [8+8]
2. Consider the subsequent database.
Employee (employee-name, street, city)
Works (employee-name, company-name, salary)
Company (company-name, city)
Manager (employee-name, manager-name)
provide an expression in the relational algebra, the tuple relational calculus, and the
domain relational calculus, for the subsequent query.
obtain the names of all employees who work for estate bank. [16]
3. (a) discuss in detail the two ways of executing pipeline?
(b) Write the SQL expressions for the subsequent relational database? [6+10]
sailor schema (sailor id, Boat id, sailorname, rating, age)
Recerves (Sailor id, Boat id, Day)
Boat Schema (boat id, Boatname, color)
i. obtain the age of the youngest sailor for every rating level?
ii. obtain the age of the youngest sailor who is eligible to vote for every rating
level with at lead 2 such sailors?
iii. obtain the No.of reservations for every red boat?
iv. obtain the avg. age of sailor for every rating level that at lowest two sailors.
4. discuss the FD and MVD with examples? [16]
5. (a) describe the concept of schedule for a set of concurrent transaction. provide a
suitable example. [8]
(b) discuss read-only, write-only & read-before-write protocols in serialazability.
[8]
6. (a) Write the locking compatibility matrix used for multiple granularity? discuss
with suitable example. [8]
(b) write Thomas write rule. How the rule differ from timestamp based rule. [8]
7. (a) discuss about tertiary storage media in detail.(b) discuss about Buffer Manager. [8+8]
8. Construct a B+
-tree for the subsequent set of key values. (2,3,5,7,11,17,19,23,29,31)
presume that the tree is initially empty and values are added in ascending order.
Construct B+
-tree for the cases where the number of pointers that will fit in one
node is as follows.
(a) four
(b) six
(c) eight

Earning:   Approval pending.