Академический Документы
Профессиональный Документы
Культура Документы
1
II B.Tech II Semester 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
⋆⋆⋆⋆⋆
i. Retrieve all employees who either work in department 4 and make over
25,000 per year or work in department 5 and make over 30,000
ii. Retrieve the Social Security numbers of all employees who either work in
department 5 or directly supervise a employee who works in department
5.
iii. Retrieve the name and address of all employees who work for the “Re-
search” department
iv. List all the projects on which employee “Smith” is working. [3+3+3+3]
(b) What is relational completeness? If a query language is relationally complete,
can you write any desired query in that language [4]
3. Consider the two internal organizations for heap files (using lists of pages and a
directory of pages).
(a) Describe them briefly and explain the trade-offs. Which organization would
you choose if records are variable in length.
(b) Can you suggest a single page format to implement both internal file organi-
zations? [8+8]
4. Discuss the merits and demerits of hash join, sort-merge join and block nested loops
join. [16]
1 of 2
Code No: RR220502 Set No. 1
5. (a) Write short notes on
- cost-based optimization
- heuristic optimization
(b) Detail on the structure of query optimization. [5+5+6]
A → BC F →A
C →A
D →E E →D
8. (a) When a system recovers from a crash ? In what order must transaction be
Undone and Redone? Why is this order important?
(b) What is a log in the content of DBMS? How does check pointing eliminate
some of the problems associated with log based recovery? [8+8]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR220502 Set No. 2
II B.Tech II Semester 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) What is an unsafe query? Give an example and explain why it is important
to disallow such queries. [6]
(b) Consider the following schema given. The primary keys are underlined. PROJECT(Projectnu
Project Name, Chief Architect)
EMPLOYEE( Empnum, Empname)
ASSIGNED TO(Projectnum, Empnum)
2. (a) what are the various salient features of the QBE ? [7]
(b) Explain the following :
i. Relational database query.
ii. Query language
iii. SQL
iv. Embedded SQL. [2+2+2+3]
3. (a) Construct a B tree of order 2 to maintain the keys 1,9,8,6,4,5 and 10.
(b) Show how 4 is replaced by 7 in the tree constructed in the above question.
[8+8]
5. Discuss in detail about estimating the cost of an evaluation plan for a query block.
[16]
6. (a) Explain why 4NF is more desirable Normal Form than BCNF.
1 of 2
Code No: RR220502 Set No. 2
(b) Consider the relation R(A,B,C,D,E) and FD’s
A− > BC
C− > A
D− > E
F− > A
E− > D
Is the Decomposition R in to R1(A,C,D) , R2(B,C,D) and R3(E,F,D) loss
less? Explain the requirement of lossless decomposition. [8+8]
8. (a) When a system recovers from a crash ? In what order must transaction be
Undone and Redone? Why is this order important?
(b) What is a log in the content of DBMS? How does check pointing eliminate
some of the problems associated with log based recovery? [8+8]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR220502 Set No. 3
II B.Tech II Semester 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
⋆⋆⋆⋆⋆
3. (a) Explain the limitations of static hashing. Explain how this is overcome in
dynamic hashing.
(b) Write a note on indexed sequential files. [10+6]
5. Discuss different types of parameters that are used in cost functions. Where is this
information kept? [16]
6. (a) List the three design goals for relational database and explain why they are
desirable.
1 of 2
Code No: RR220502 Set No. 3
(b) Consider the relation scheme Emp Dept( Ename, SSN, Bdate, Address, Dnum-
ber, Dname, DMGRSSN) and the following set of FD’s
F={ SSN− > Ename,Bdate, Address, Dnumber
Dnumber− > Dname, DMGRSSN}
Calculate the closer {SSN}+ and {Dnumber}+ with respect to F. [6+10]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR220502 Set No. 4
II B.Tech II Semester 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
⋆⋆⋆⋆⋆
2. (a) what are the various salient features of the QBE ? [7]
(b) Explain the following :
i. Relational database query.
ii. Query language
iii. SQL
iv. Embedded SQL. [2+2+2+3]
3. What are differences among primary, secondary and clustering indices? How do
these differences affect the implementation of indices? Which of the indexes are
dense and which are not. [16]
5. Discuss different types of parameters that are used in cost functions. Where is this
information kept? [16]
1 of 2
Code No: RR220502 Set No. 4
7. (a) Define these terms atomicity, consistency, isolation, durability, schedule, blind
write.
(b) Write a note on the properties of tansactions. [12+4]
8. (a) When a system recovers from a crash ? In what order must transaction be
Undone and Redone? Why is this order important?
(b) What is a log in the content of DBMS? How does check pointing eliminate
some of the problems associated with log based recovery? [8+8]
⋆⋆⋆⋆⋆
2 of 2