Jawaharlal Nehru Technological University Kakinada 2009-2nd Sem B.E Computer Science and Engineering II BTech–Regular s, (DATABASE MANAGEMENT SYSTEM) - Question Paper

Code: 3220503 SET -1


II B. Tech. – II Semester Regular Examinations, April 2009.
DATABASE MANAGEMENT SYSTEM
(Common to CSE and IT)
Time: three Hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
***********
1. a) discuss the drawbacks of traditional file processing systems with examples.
b) discuss the 3 levels of data abstraction. (8+8)

2. discuss various constructs that adds expressiveness to the ER Model. (16)

3. a) What is a view and discuss various kinds of views and how they can be
created using S QL? (6)
b) Consider the subsequent database.
Employee (employee-name, street, city)
Works (employee-name, company-name, salary)
Company (company-name, city)
Manager (employee-name, manager-name)
provide an expression in the relational algebra, the tuple relational calculus, and the
domain relational calculus, for the subsequent queries.
i. obtain the names of all em ployees who work for "XYZ" bank.
ii. obtain the street, city of the employee working under manager "Krishna". (5+5)

4. a) Why are null values not preferable in a relation?
b) What is an unsafe query? provide an example and discuss why it is important to
disallow such queries.
c) define the "dynamic SQL".
d) discuss various Binary Operations? (3+4+3+6)

5. a) What is dependency preserving for decomposition? discuss why it is
important.
b) describe 3NF and discuss with an example? (8+8)

6. a) describe the concept of schedule for a set of concurrent transaction. provide a
suitable example.
b) discuss how granularity of locking affects the performance of concurrency
control algorithm. (8+8)

7. a) What is log in DBMS? How does check point eliminate a few of the issues
associated with log based recovery?
b) discuss three main properties of ARIES Algorithm (10+6)

8. discuss about the B+ tree and its structure in detail with an example. (16)

Earning:   Approval pending.