Code No: RA210506


II B.Tech Supplimentary Examinations, Aug/Sep 2008 DATA BASE MANAGEMENT SYSTEMS ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. (a) Define the concept of aggregation. Give an example of where this concept is useful. (b) Explain the difference between a weak and a strong entity-set. 2. (a) Distinguish between procedural and non-procedural DML’s. (b) Define relational algebra, Tuple & Domain relational calculus. (c) What are the differences between the two types of relational calculus? [6+6+4] 3. (a) Define selection and also explain complex selection (b) for the following relational database write the expressions in SQL. flight (flight no, from, to, distance, departs arrives, price) Aircraft (Aid, Aircraftname, cruising range) Certified (Emp cd, Aid) Employee (Emp id, Empname, salary) [6M] [10M] [8+8]

i. Find the names of pilot whose salary are individually less than price of the cheapest route from Los Angles to Honolulu ? ii. Print the enames of pilots who can operate planes with cursing range greater than 5000 miles, but r not certified on any boxing aircraft? iii. Find the names of pilots certified for some Boeing aircraft? iv. Find the aids of all aircraft that can be used on routes Los Angles to Chicago? v. Compute the difference b/n the average salary of a pilot and the average salary of all employees? 4. Consider the relation R(A,B,C,D,E,F) and FDs A → BC, F → A, C → AD → E, E → D AD is the decomposition of R into R1(A,C,D) R2 (B,C,D) and R3 (E,F,D) loss less? Explain the requirement of Loss less decomposition? 5. Give an example schedule wit actions of transactions T1 & T2 on objects X & Y that results in a (a) Write-read conflict (b) Read-write conflict (c) Write-write conflict 1 of 2 [16M]

Code No: RA210506

[4M] [6M] [16]

6. (a) What are the merits & demerits of using fuzzy dumps for media recovery. [6M] (b) Explain the phases of ARIES Algorithm. (c) Explain 3 main properties of ARIES Algorithm 7. Compare the Heap file organization and Sequential file organization.

+ + 8. Explain about the B− tree and the structure of B− tree in detail with an example. [16]

2 of 2

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.