DATA BASE MANAGEMENT SYSTEMS II B.Tech II Semester Regular Examinations, April 2010

Code No: V0523/R07 Set No. 1
             II B.Tech II Semester Regular Examinations, April 2010
                   DATA BASE MANAGEMENT SYSTEMS                       ( Common to Computer Science & Engineering and InformationTechnology)
                                                                                                                       Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. (a) Explain the Transaction management in a database.
(b) Discuss the Query Processor of Database system structure. [8+8]
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) Explain the basic structure of SQL?
(b) Write SQL expressions for the following relational databases. employee (empno,
empname, gender, dob, doj, empadd, emptelno, empsalary, empdept, bonus,
dor)
i. Find empname from emp schema table who joins at the same date?
ii. Find empadd, empname who are working in the same department?
iii. Find the salary from emp schema who are earing more than 6000?
iv. Find how many records are in table emp schema?
v. Find empno, empname, empdept from emp schema where empsalary is
b/n. [8+8]
4. (a) Define BCNF. How does BCNF differ from 3NF? Explain with an example.
(b) Explain 3nf? Give one example? [8+8]
5. (a) Explain how concurrency execution of transactions improves overall system
performance. [8]
(b) What are the transaction isolation Levels in SQL. [8]
6. (a) Contrast ARIES with other WAL based recovery schemes. [6]
(b) How is the recovery manager is responsible for transaction atomicity & dura-
bility. [5]
(c) What are the difference between update log record & compensation log record.
[5]
7. Define the term dangling pointer. Describe how the unique-id scheme helps in
detecting dangling pointers in an object-oriented database. [16]
8. Suppose that we are using extendable hashing on a file that contains records with
the following search-key values: 2,3,5,7,11,17,19,23,29,31 Show the extendable hash
structure for this file if the hash function is h(x) = x mod 8 and buckets can hold
three records. [16]

Code No: V0523/R07 Set No. 2
      II B.Tech II Semester Regular Examinations, April 2010
              DATA BASE MANAGEMENT SYSTEMS
   ( Common to Computer Science & Engineering and InformationTechnology)
                                                                                                                    Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. (a) Why would choose 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. (a) What is a relation? Differentiate between relation schema and relation in-
stance. Define the terms unity and degree of relation. What are domain
constraints?
(b) Explain new insertion, delation and updating of database is performed in the
relational algebra. [8+8]
3. Explain the following [16]
(a) Types of Join Operations.
(b) Set Operations
4. (a) Explain about 4 Nf? Give one example?
(b) Explain about 5 Nf? Give one example? [8+8]
5. (a) Explain how concurrency execution of transactions improves overall system
performance. [8]
(b) What are the transaction isolation Levels in SQL. [8]
6. (a) What are the merits & demerits of using fuzzy dumps for media recovery. [6]
(b) Explain the phases of ARIES Algorithm. [4]
(c) Explain 3 main properties of ARIES Algorithm [6]
7. Explain why the allocation of records to blocks affects database-system performance
significantly. [16]
8. What are the differences between B-tree indices and B+
−tree indices. Explain in
detail. [16]

Code No: V0523/R07 Set No. 3
           II B.Tech II Semester Regular Examinations, April 2010
             DATA BASE MANAGEMENT SYSTEMS
        ( Common to Computer Science & Engineering and InformationTechnology)
                                                                                                                Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. What are the major disadvantages of file processing system? [16]
2. (a) What is a relation? Differentiate between relation schema and relation in-
stance. Define the terms unity and degree of relation. What are domain
constraints?
(b) What SQL construct enables the definition of a relation? What constructs
allow modification of relation instances? [8+8]
3. (a) Explain in detail about the “Outer join” Operation.
(b) For the following relational database, give the expressions in SQL. [8+8]
Sailor schema (sailor id, sailorname, rating, Age) Reserves (sailor id, Boat)id,
day) Boat Schema(Boat id, boatname, color)
i. find the name and age of the oldest sailors?
ii. Count the No.of sailors?
iii. Count the No.of different sailors names?
iv. Find the names who are older than the oldest sailors with rating of 10?
4. Explain the FD and MVD with examples? [16]
5. (a) Define the concept of schedule for a set of concurrent transaction. Give a
suitable example. [8]
(b) Explain read-only, write-only & read-before-write protocols in serialazability.
[8]
6. (a) What are the two tables used in crash recovery along with log record. Explain
with suitable example. [8]
(b) What are the different fields of log record. Explain each in brief. [8]
7. Define the term dangling pointer. Describe how the unique-id scheme helps in
detecting dangling pointers in an object-oriented database. [16]
8. Explain about the B+
−tree and the structure of B+
−tree in detail with an example.
[16]

Code No: V0523/R07 Set No. 4
      II B.Tech II Semester Regular Examinations, April 2010
             DATA BASE MANAGEMENT SYSTEMS  ( Common to Computer Science & Engineering and InformationTechnology)
                                                                                                                   Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. (a) Explain the Transaction management in a database.
(b) Discuss the Query Processor of Database system structure. [8+8]
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. [6+10]
flight (flight no, from, to, distance, departs arrives, price)
Aircraft (Aid, Aircraftname, cruising range)
Certified (Emp cd, Aid)
Employee (Emp id, Empname, salary)
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. (a) Explain about 4 Nf? Give one example?
(b) Explain about 5 Nf? Give one example? [8+8]
5. (a) Explain how concurrency execution of transactions improves overall system
performance. [8]
(b) What are the transaction isolation Levels in SQL. [8]
6. (a) What is 2PL Locking protocol? Explain with suitable example? How does it
guarantee serialazability? [12]
(b) Difference between Strict 2PL & Rigorous 2PL [4]
7. List the physical storage media available on the computers youu use routinely. Give
the speed with which data can be accessed on each mediaum. [16]
8. (a) Explain about Hash indices with an example.
(b) Explain the differences between Static Hashing and Dynamic Hashing. [8+8]