II B.Tech II Semester (R07) Supplementary Examinations, Nov/Dec- 2010 DATABASE MANAGEMENT SYSTEMS

II B.Tech II Semester (R07) Supplementary Examinations, Nov/Dec- 2010
DATABASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. a) How data isolation ,data redundancy and inconsistency problems are handled with DBMS?
b) Discuss in detail about database languages. (8+8M)
2. a) Construct an E-R diagram for a 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. Document all assumptions that you
make about the mapping constraints.
b) Explain the difference between a weak and a strong entity set with examples. (8+8M)
3. a) What are integrity constraints? Explain “Integrity Constraints over Relations”
b) Compare domain and tuple relational calculus in detail. (8+8M)
4. a) Explain the Group by and Having clauses .
b) What is meant by a null value? Discuss about comparisons using null values. (8+8M)
5. a)What is join dependency? How is it different from multi-valued dependency and functional
dependency, and explain join dependencies and multi-valued dependencies with suitable
example.
b) Consider the relation R(A,B,C,D,E,F) and FD’s
A -> BC F -> A
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)
lossless? Explain the requirement of loss less decomposition. (8+8M)
6. a) What is log in DBMS? How does check point eliminate some of the problems associated
with log based recovery?
b) Explain 3 main properties of ARIES Algorithm. (8+8M)
7. a) Explain different types of failures that arise due to loss of non-volatile storage.
b) Explain in detail about Cluster Index, Hash based and Tree based indexing. (8+8M)
8. a) Explain about the B+ tree, its operations and its structure in detail with an example.
b) Compare and contrast extendible Vs linear hashing. (8+8M)
1 of 1
SET - 1


Code No: V0523 /R07
II B.Tech II Semester (R07) Supplementary Examinations, Nov/Dec- 2010
DATABASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. a) Explain the three levels of data abstraction
b) What is a data model? Explain the relational data model. (8+8M)
2. a) Explain in detail about enforcing integrity constraints .
b) Write about Join operations. (8+8M)
3. a) What are views? Discuss the problems encountered in modifying database through views.
b) Explain the following fundamental operations of relational algebra. Select project set
rename. (8+8M)
4. a)What is Nested Query? How it is different from Correlated nested query, explain with
suitable examples.
b) Write a short note on triggers. (8+8M)
5. a) What is dependency preserving for decomposition? Explain why it is important.
b) Define 3NF and explain with an example? (8+8M)
6. a) Discuss in detail about the implementation of isolation.
b) What is concurrency control? How is it implemented in DBMS? Explain. (8+8M)
7. a) Explain in detail the phases of ARIES Algorithm
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+8M)
8. a) Explain all the operations on B+ tree by taking a sample example.
b) Give a detailed note on file organization and indexing. (8+8M)
1 of 1
SET - 2


Code No: V0523 /R07
II B.Tech II Semester (R07) Supplementary Examinations, Nov/Dec- 2010
DATABASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. a) Explain the structure of DBMS with neat diagram.
b) Define instance, schema and data independence. Explain various types of Data
Independence. (8+8M)
2. a) Illustrate an ER model with a weak entity set. Illustrate how it can be transformed into
tables.
b) What is ISA? Briefly explain this with an example. (8+8M)
3. 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+8M)
4. a) What aggregate operators does SQL support?
b) What are null values? Are they supported in relational model? How do they affect the
meaning of queries? Can primary key fields of a table contain null values? (8+8M)
5. a) Discuss in detail about decomposition and lossless decomposition.
b) Contrast 3NF decomposition method with BCNF decomposition method illustratively.
(8+8M)
6. a) What is a serializable schedule ? What is a recoverable schedule? What is a schedule that
avoids cascading aborts? What is a strict schedule?
b) Why does a DBMS interleave concurrent transactions? (8+8M)
7. a) Define the concept of a schedule for a set of concurrent transactions. Give a suitable
example.
b) Explain how does granularity of locking affect the performance of concurrency control
algorithm. (8+8M)
8. a) Explain about the B + tree and the structure of the B + tree in detail with an example.
b) Compare the Heap file organization and Sequential file organization. (8+8M)
1 of 1
SET - 3


Code No: V0523 /R07
II B.Tech II Semester (R07) Supplementary Examinations, Nov/Dec- 2010
DATABASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. a) What are the main functions of a Database Administrator?
b) Define the following terms with suitable examples
i) Entity and Entity Set ii) Relationship and Relationship set (8+8M)
2 a) Discuss about conceptual design with the ER model .Illustrate this with an example.
b) With a neat diagram write short notes on weak entity set. (8+8M)
3. 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+8M)
4. a) What are nested queries? What is the correlation in nested queries? How would you use the
operators IN, EXISTS, UNIQUE, ANY and ALL in writing nested queries? Why are they
useful? Illustrate your answer by showing how to write the division operator in SQL.
b) What are null values? Are they supported in relational model? How do they affect the
meaning of queries? Can primary key fields of a table contain null values? (8+8M)
5. a) Discuss loss-less join decomposition
b) Define BCNF. Discuss in detail about decomposition algorithm. (8+8M)
6. a) Give test for conflict seiraliziability. Check whether the following schedule is conflict
serializable
T1 T2
read(A)
write(A)
read(A)
write(A)
read(B)
write(B)
read(B)
write(B)
b) Describe in detail about the implementation of atomicity and durability. (8+8M)
7. a) Discuss the un-do and re-do operations and explain the recovery techniques that use these
operations?
b) Discuss in detail about advance recovery systems. (8+8M)
8. a) Describe in detail about Hash Based Indexing and Tree base Indexing
b) Explain about Variable-Length file organization with an example. (8+8M)
1 of 1
SET - 4