Jawaharlal Nehru Technological University Kakinada 2010 B.Tech Computer Science and Engineering DBMS of --SET 1 - Question Paper

CODE No: V0523/R07 Set No. 1
II B.Tech II Semester Regular Examinations, April 2010
DATA BASE MANAGEMENT SYSTEMS
( Common to Computer Science & Engineering and info
Technology)
Time: three hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
1.(a) discuss the Transaction management in a database.[8+8]
(b) explain the Query Processor of Database system structure.
2 (a) Distinguish ranging from procedural and non-procedural DML's.
(b) describe relational algebra, Tuple & Domain relational calculus.
(c) elaborate the differences ranging from the 2 kinds of relational calculus? [6+6+4]
3. (a) discuss the basic structure of SQL?
(b) Write SQL expressions for the subsequent relational databases. employee (empno,
empname, gender, dob, doj, empadd, emptelno, empsalary, empdept, bonus,
dor)
i. obtain empname from emp schema table who joins at the identical date?
ii. obtain empadd, empname who are working in the identical department?
iii. obtain the salary from emp schema who are earing more than 6000?
iv. obtain how many records are in table emp schema?
v. obtain empno, empname, empdept from emp schema where empsalary is
b/n. [8+8]
4. (a) describe BCNF. How does BCNF differ from 3NF? discuss with an example.
(b) discuss 3nf? provide 1 example? [8+8]
5. (a) discuss how concurrency execution of transactions improves overall system
performance. [8]
(b) elaborate the transaction isolation Levels in SQL. [8]
6. (a) Contrast ARIES with other WAL based recovery schemes. [6]
(b) How is the recovery manager is responsible for transaction atomicity & dura-
bility. [5]
(c) elaborate the difference ranging from update log record & compensation log record.
[5]
7. describe the term dangling pointer. define how the unique-id scheme helps in
detecting dangling pointers in an object-oriented database. [16]
8. Suppose that we are using extendable hashing on a file that contains records with
the subsequent 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 eight and buckets can hold
three records.[16]

Earning:   Approval pending.