Code No: R05210506 Set No.

1
II B.Tech I Semester Supplimentary Examinations, November 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) Describe about the three levels of Data Abstraction.

(b) What are the types of languages a database system provides? Explain. [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. (a) explain about decomposition?

(b) Suppose the schema 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 FD hold ABC, CDE, BD, EA. [8+8]

4. Explain the 4NF. Why is it useful? Explain with example [16]

5. (a) Write a short notes on

i. Serialazability
ii. Recoverability [10]
(b) Why must lock & unlock be atomic operation? [6]

6. (a) State & justify the Thomas write rule. [8]

(b) Describe each of the following locking protocols
i. 2PL
ii. Conservative 2PL [8]

7. In the sequential file organization, why is an overflow block used even if there is,
at the moment, only one overflow record? [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]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05210506 Set No. 2
II B.Tech I Semester Supplimentary Examinations, November 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. What are the major disadvantages of file processing system? [16]

2. (a) What is a foreign key constraint? Why are such constraints important? What
is referential integrity?
(b) How many distinct tuples are in a relation instance with cardinality 22? [8+8]

3. (a) What is functional dependency ? how it is useful in dbms?

(b) Normalize the relation R (A, B, C, D, E, F, G, H) into the 3NF using the
following set of FDs ABC, BCD, CDEABH, BHA, DEF is the decomposition
dependency preserving? [8+8]

4. (a) Explain about 4 Nf? Give one example?

(b) Explain about 5 Nf? Give one example? [8+8]

5. (a) Explain the concept of transaction atomicity. [6]

(b) How does the two phase locking protocol ensures Serialazability. [10]

6. (a) Describe how fuzzy checkpoints are used in ARIES [6]

(b) Develop an example showing how a single locking protocol could lead to a
deadlock. [10]

7. Explain about various physical storage media in detail. [16]

+
8. Explain about the B− tree file organization in detail.. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05210506 Set No. 3
II B.Tech I Semester Supplimentary Examinations, November 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) Explain the Transaction management in a database.

(b) Discuss the Query Processor of Database system structure. [8+8]

2. (a) What is a relational database query? Explain with an example.

(b) What are the SQL constructs to modify the structure of tables, views and to
destroy the tables and views? [8+8]

3. What is Normalization? Discuss what are the types? Discuss the 1NF, 2NF, 3NF
with example. [16]

4. (a) Define BCNF. How does BCNF differ from 3NF? Explain with an example.
(b) Explain 3nf? Give one example? [8+8]

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) Explain optimistic concurrency control under timestamp [8]

(b) Discuss about deadlock detection & starvation. [8]

7. (a) Explain about Fixed-Length Representation in detail.

(b) Explain about Byte-String Representation. in detail. [8+8]

8. (a) When is it preferable to use a dense index rather than a sparse index? Explain
your answer.
(b) Since indices speed query processing, why might they not be kept on several
search keys? List as many reasons as possible. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05210506 Set No. 4
II B.Tech I Semester Supplimentary Examinations, November 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) Write about the different types of Database Users.

(b) Write about the storage manager of database system structure. [8+8]
2. (a) What is an unsafe query? Give an example and explain why it is important
to disallow such queries?
(b) What is relational completeness? If a query language is relationally complete,
can you write any desired query in that language. [8+8]
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. Explain the 4NF. Why is it useful? Explain with example [16]
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. 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. What are the differences between B-tree indices and B− tree indices. Explain in
detail. [16]

⋆⋆⋆⋆⋆

1 of 1