Click Here: (PDF Download)
Time: 3 Hours
Total Marks: 100
N.B.: (1) Questions No. 1 is Compulsory.
(2) Answer any 4 from the remaining.(3) All questions carry equal marks.
Q.1 Attempt The Following Question: (20 Marks)
(A) Write a short note on Transaction Management.(B) Explain the following commands with example:
(i) Select
(ii) Update
(iii) Insert
(iv) Delete
(v) Drop
Q.2 Attempt The Following Question: (20 Marks)
(A) Write a short note on E-R Model.
(B) Explain Mapping Constraints in brief.
Q.3 Attempt The Following Question: (20 Marks)
(A) Give the structure of Relational Database.
(B) Consider the following schema: –
Suppliers (Sid : integer ,Sname : string, address : string)
Parts (PID : integer , Pname: String , color: string)
Catalog (Sid : integer , Pid : integer , cost : real)
• Find the Pnames of parts of which there is some supplier.
• Find the Snames of suppliers who supply every part.
• Find the Sid of suppliers who supply only red parts.
Q.4 Attempt The Following Question: (20 Marks)
(A) Describe the advantage of pipelining.
(B) Give different types of Aggregate Function.
Q.5 Attempt The Following Question: (20 Marks)
(A) Define Transaction. Explain ACID properties.
(B) Write a short note on Serializability and Recoverability.
Q.6 Attempt The Following Question: (20 Marks)
(A) Explain the concept of deadlock with deadlock prevention and recovery from deadlock.
(B) Explain different types of attributes.
Q.7 Attempt The Following Question: (20 Marks)
(A) Write a short note on Timestamp Based Protocol.
(B) Explain Decomposition in relational Database Design.
0 Comments