Code No: RR321903 Set No.

1
III B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
DATA BASE MANAGEMENT SYSTEMS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Explain the different types of integrity constraints with suitable examples. [16]
2. (a) What are views? Discuss the problems encountered in modifying database
through views.
(b) What is an embedded SQL? Give examples. [10+6]
3. (a) Write a note on dense and sparse indexing.
(b) Write a note on fixed and variable length records. [8+8]
4. (a) Explain what role do statistics gathered from the database play in query op-
timization?
(b) What are the important design decisions that must be made in optimizing the
relational queries? [6+10]
5. Discuss different types of parameters that are used in cost functions. Where is this
information kept? [16]
6. (a) Construct an E-R diagram for university registrar’s office. The office maintains
data about each class, including the instructor, the enrollment and the time
and place of the class meetings. For each student class pair, a grade is recorded.
Determine the entities and relationships that exist between the entities. Also
construct the tabular representation of the entities and relationships.
(b) What is an entity type? What is an entityset? Explain the difference between
the entity, entity type and entityset? [10+6]
7. (a) Consider two transactions as follows:
Transaction 1: Fac salary:=Fac salary+1025.00
Transaction 2: Fac salary:= Fac salary *1.1
What precaution, if any, would you suggest if these were to run concurrently?
Write a pseudo code program for these transactions using an appropriate
scheme to avoid undesirable results.
(b) Explain Wait-die and Wound-wait in Deadlock prevention? [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]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR321903 Set No. 2
III B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
DATA BASE MANAGEMENT SYSTEMS
(Electronics & Computer 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)

Write the following queries in Tuple relational calculus

i. Find Empnum of employees working on project COMP454
ii. Find the details of employees(both number and name) working on the
project COMP365
iii. Find the details of employees working on the ”Database” project
iv. Find the Empnum?s of employees who do not work on project COMP464
v. Find the Empnum?s of employees who work on all projects [1+2+2+2+3]

2. (a) What are views? Discuss the problems encountered in modifying database
through views.
(b) What is an embedded SQL? Give examples. [10+6]

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]

4. (a) Explain about projection based on sorting.

(b) Explain about projection based on hashing. [8+8]

5. Show that the following equivalences hold and explain how they can be applied to
improve the efficiency of certain updates.

(a) (r1 ∪ r2) ∪ r3 = r1 ∪ (r2 ∪ r3)

(b) r1 ∪ r2 = r2 = r2 ∪ r3
(c) σp (r1 − r2) = σp(r1) − σp (r2) [5+4+7]

6. (a) Use the axioms for functional and multivalued dependencies to show that the
following rules are sound
i. the multivalued union rule

1 of 2
Code No: RR321903 Set No. 2
ii. the intersection rule
iii. the difference rule [3+3+3]
(b) Explain why DKNF is highly desirable normal form , yet one that is difficult
to achieve in practice. [7]

7. Write short notes on

(a) dead lock.

(b) exclusive lock.
(c) binary lock.
(d) live lock. [4+4+4+4]

8. Explain WAL Protocol, UNDO algorithm, Check pointing and Media Recovery?
[16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR321903 Set No. 3
III B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
DATA BASE MANAGEMENT SYSTEMS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Draw the architecture of a DBMS and explain the functionality of each component
in it. [16]

2. (a) Consider the following schema given. The primary keys are underlined.
Sailors(sailor-id, sailor-name, sailor-rating, sailor-age)
Boats(boat-id, boat-name, boat-color)
Reserves(sailor-id, boat-id, day)

Write the Nested queries in SQL.

i. Find the names of sailors who have reserved boat number 120
ii. Find the names of sailors who have reserved a green boat
iii. Find the names of sailors who have not reserved a green boat
iv. Find the names of sailors with the highest rating [2+2+3+3]
(b) Explain the GROUP BY and HAVING clauses. [6]

3. (a) Which of the three basic file organizations would you choose for a file where
the most frequent operations are as follows,
i. Search for records based on a range of field values.
ii. Perform insert and scans where the order of records does not matter.
iii. Search for a record based on a particular field value.
(b) Define dense index.
(c) How does multi level indexing improve the performance of searching an index
file. [6+4+6]

4. Discuss about the following

(a) Hybrid hash − join

(b) Complex joins [8+8]

5. Discuss in detail about estimating the cost of an evaluation plan for a query block.
[16]

6. (a) Explain functional dependencies and multivalued dependencies with examples.

(b) Consider the relation R(A,B,C,D,E,F) and FD’s

A → BC F →A

1 of 2
Code No: RR321903 Set No. 3
C →A
D →E E →D

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. [8+8]

7. (a) Describe Strict 2PL. [5]

(b) Explain the following:
i. Serializable schedule
ii. Unrepeatable read
iii. Avoids-cascading-aborts schedule [4+3+4]

8. Explain in detail the ARIES recovery method. [16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR321903 Set No. 4
III B.Tech II Semester Supplimentary Examinations, Aug/Sep 2007
DATA BASE MANAGEMENT SYSTEMS
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain about various binary operations with examples in relational algebra.
(b) Discuss the use of rename operator with an example. [12+4]

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) Explain what the buffer manager must do to process a read request for a page
. what happens if the requested page is in the pool but not pinned.
(b) Explain what happens if there is a page request when all pages in the buffer
pool are dirty. [8+8]

4. (a) Consider the following SQL query for a bank database

SelectT.branch − name
F rombranchT, branchS
whereT.Assets ¿ S.assetsandS.branch − city = ”HY DERABAD′′
Write an efficient relational algebra expression that is equivalent to the query.
(b) Define query optimization and at what point during query processing does
optimization occur? [8+8]

5. (a) What is indexing ? Explain with an example.

(b) Explain about query processing. [8+8]

6. (a) List the three design goals for relational database and explain why they are
desirable.
(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]

7. (a) Define these terms atomicity, consistency, isolation, durability, schedule, blind
write.
(b) Write a note on the properties of tansactions. [12+4]

1 of 2
Code No: RR321903 Set No. 4
8. (a) Write short notes on
i. Write-Ahead log protocol
ii. Check pointing [4+4]
(b) Explain how a System Crash can be recovered using ARIES algorithm? [8]

⋆⋆⋆⋆⋆

2 of 2