Code No: RR411004 Set No.

1
IV B.Tech I Semester Regular Examinations, November 2007
DATA BASE MANAGEMENT SYSTEMS
( Common to Electronics & Instrumentation Engineering and Electronics &
Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Write about the following operations with suitable examples.

(a) Select operation

(b) Project operation
(c) Rename operation
(d) Natural join operation. [3+3+4+6]

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) 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) The system R optimizer.

(b) The iterator interface for operators and access methods. [10+6]

5. Discuss various cost estimation methods of access based on indexing principle for
relation operators. [16]

6. (a) Let R=(A,B,C,D,E) and let M be the following set of multivalued dependencies
A− >> BC
B− >> CD
E− >> AD
List the nontrivial dependencies in M+
(b) Describe the properties of normalized and unnormalized relations. [10+6]

7. Write short notes on

1 of 2
Code No: RR411004 Set No. 1
(a) dead lock.
(b) exclusive lock.
(c) binary lock.
(d) live lock. [4+4+4+4]

8. (a) How is the Recovery Manager is responsible for transaction atomicity and
durability? Explain.
(b) Explain Stealing Frames and Forcing pages?
(c) What are difference between update log record and CLRS? [7+5+4]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR411004 Set No. 2
IV B.Tech I Semester Regular Examinations, November 2007
DATA BASE MANAGEMENT SYSTEMS
( Common to Electronics & Instrumentation Engineering and Electronics &
Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Consider the following scheme given. The primary keys are underlined.
Sailors(sailor-id, sailor-rating, sailor-age)
Boats(boat-id, boat-name, boat-color)
Reserves(sailor-id, boat-id, day)
Write the queries in Relational algebra
i. Find the names of sailors who have reserved a red and a green boat
ii. Find the names of sailors who have reserved at least two boats
iii. Find the sailor-ids of sailors with age over 22 and who have not reserved
a green boat.
iv. Find the names of sailors who have reserved all boats
v. Find the names of sailors who have reserved all boats called BlueMoon.
[2+2+2+2+2]
(b) Given two relations R1 and R2 , where R1 contains N1 tuples, R2 contains
N2 tuples, and N2> N1 > 0 , give the minimum and maximum possible sizes
(in tuples) for the result relation produced by each of the following relational
algebra expressions. In each case, state any assumptions about the schemas
for R1 and R2 that are needed to make the expression meaningful.
i. R1 U R2
ii. R1 ∩ R2
iii. R1 - R2.
[2+2+2]

2. (a) Consider the following schema:

Suppliers (sid: integer, sname: string, address: string)
Parts (Pid: integer, pname; string, color: string)
Catalog ( Sid: integer, pid: integer, cost: real)
Write the following queries in SQL.
i. Find the names of suppliers who supply red part.
ii. Find the sids of suppliers who supply all parts.
iii. Find the pids of parts that are supplied by at least two different suppliers.
iv. Find the pids of the most expensive parts supplied by the suppliers named
TATA. [3+3+3+3]
(b) Why are null values not preferable in a relation. [4]

1 of 2
Code No: RR411004 Set No. 2
3. (a) Write a note on secondary indexes.
(b) Write a note on sparse and dense indexes. [8+8]

4. (a) Discuss about selections using Indices.

(b) Discuss about selections involving comparisons. [8+8]

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

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

6. (a) Suppose the scheme R =(A,B,C,D,E) is decomposed into (A,B,C) and (A,D,E),
show that the decomposition is not a dependency preserving decomposition if
the following set of functional dependencies hold.

A− > BC
CD− > E
B− > D
E− > A

(b) List all functional dependencies satisfied by the following relation.

A B C
a1 b1 c1
a1 b1 c2 [10+6]
a2 b1 c1
a2 b1 c3

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

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

⋆⋆⋆⋆⋆

2 of 2
Code No: RR411004 Set No. 3
IV B.Tech I Semester Regular Examinations, November 2007
DATA BASE MANAGEMENT SYSTEMS
( Common to Electronics & Instrumentation Engineering and Electronics &
Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) With the help of a neat diagram describe the structure of a DBMS.
(b) Explain the responsibilities of a DBA ? [10+6]

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. 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]

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. Discuss various cost estimation methods of access based on indexing principle for
relation operators. [16]

6. (a) Explain why the PJNF is more desirable normal form than 4NF.
(b) Explain Domain Key Normal Form(DKNF) with example. [8+8]

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

(b) Explain the following:
i. Serializable schedule

1 of 2
Code No: RR411004 Set No. 3
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: RR411004 Set No. 4
IV B.Tech I Semester Regular Examinations, November 2007
DATA BASE MANAGEMENT SYSTEMS
( Common to Electronics & Instrumentation Engineering and Electronics &
Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain about referential integrity constraints with suitable examples.

(b) Distinguish between tuple relational calculus and relational calculus.
(c) Describe table constraints [6+6+4]

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) Write a note on pinned and unpinned records.

(b) If the records are stored in a disk block of size 1024 bytes. Explain the various
low level functions needed to implement the physical layer of a typical DBMS.
[6+10]

4. Explain the

(a) decomposition of a query into blocks.

(b) The first step in optimizing a query block is to express it as a relational algebra
expression − Discuss. [8+8]

5. Discuss various cost estimation methods of access based on indexing principle for
relation operators. [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.

1 of 2
Code No: RR411004 Set No. 4
(b) What is an entity type? What is an entityset? Explain the difference between
the entity, entity type and entityset? [10+6]

7. (a) Explain the concept of log based recovery.

(b) Briefly explain why recovery is needed. [10+6]

8. (a) What are different Recovery Techniques used in Transaction Failures?

(b) Explain how System Crash and Media Failure occurs? [10+6]

⋆⋆⋆⋆⋆

2 of 2