5. E-. CCa.rrv>uJai) t$~tY\.1I') J)cJ-o.- 0~~ ~ kYV\..$.
2-7-) s-l 01ND-S162
(Total Marks: 100
N.S.: (1) Question NO.1 is compulsory. (2) Attempt any four questions out of remaining six questions. (3) Make suitable assumptions if needed. 1. (a) Explain the structure of DBMS. (b) Explain the insertion of entry in a B+ tree. (c) Explain validation based protocol. 2. (a), Explain following relational algebraic operations with example. (i) Division
6 7 7 10
(ii) Generalized Projection'
(iii) Rename (iv) Assignment (v) Outer Join' (b) What is view? How it is defined and stored? What are benefits and limitationof view? 10 (a) What is recoverable schedule? Why recoverabilityof schedule is desirable? Are there 10 'any circumstances under which it would be desirable to allow non-recoverable schedule? Explain. (b) What is deadlock? Discuss various strategies for deadlock prevention and 10 deadlock recov..