ct 2 dbms

3
8/8/2019 CT 2 DBMS http://slidepdf.com/reader/full/ct-2-dbms 1/3 Class Test II Database Management System  Notes: Attempt any 5 questions. Part (a) of each question contains 2 marks and part (b) of each question contains 8 marks. 1. (a) Explain Transaction. (b) Explain the concept of conflict serializability and view serializability. 2. (a) Explain Serial schedule and concurrent Schedule. (b) What do you mean by Transaction Processing? Explain ACID properties of transaction. 3. (a) Explain Cascade – less Schedules (b) Explain the various states of transaction. 4.  (a) Explain Recoverable Schedules. (b) Explain the need for Concurrency Control. 5. (a) Consider the precedence graph of fig below. Is the corresponding schedule conflict serializable? Explain your answer. (b) Explain 4NF and 5NF with examples. 6. (a) Explain Goals and Objectives of Normalization. (b) Define Boyce – Codd Normal Form. How does it differ from 3NF? Why is it considered stronger than 3NF? 7. (a) Explain Transitive Dependency with dependency diagram. (b) Write an algorithm for computing the closure of set of functional dependencies. Computer B + for the following set of functional dependencies: T1 T2 T4 T3 T5

Upload: dinudineshbhawnani2916

Post on 10-Apr-2018

225 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: CT 2 DBMS

8/8/2019 CT 2 DBMS

http://slidepdf.com/reader/full/ct-2-dbms 1/3

Class Test II

Database Management System

 Notes: Attempt any 5 questions. Part (a) of each question contains 2 marks and part (b) of each question

contains 8 marks.

1.  (a) Explain Transaction.

(b) Explain the concept of conflict serializability and view serializability.

2.  (a) Explain Serial schedule and concurrent Schedule.

(b) What do you mean by Transaction Processing? Explain ACID properties of transaction.

3.  (a) Explain Cascade – less Schedules

(b) Explain the various states of transaction.

4. 

(a) Explain Recoverable Schedules.(b) Explain the need for Concurrency Control.

5.  (a) Consider the precedence graph of fig below. Is the corresponding schedule conflict serializable?

Explain your answer.

(b) Explain 4NF and 5NF with examples.

6.  (a) Explain Goals and Objectives of Normalization.

(b) Define Boyce – Codd Normal Form. How does it differ from 3NF? Why is it considered stronger 

than 3NF?

7.  (a) Explain Transitive Dependency with dependency diagram.

(b) Write an algorithm for computing the closure of set of functional dependencies. Computer B+

for the following set of functional dependencies:

T1 T2

T4 T3

T5

Page 2: CT 2 DBMS

8/8/2019 CT 2 DBMS

http://slidepdf.com/reader/full/ct-2-dbms 2/3

A BC

CD E

B DE A

8. 

(a) Explain Full Functional Dependency and partial dependency with diagram.(b) Consider the relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies

F = {AB C, A DE, B F, F GH, D IJ}

What is the key for R? Decompose R into 3NF.

9.  (a) Explain Spurious Tuples.

(b) What is loss – less join property of decomposition? Why is it important?

10. (a) Explain Shared and Exclusive Locks.

(b) Explain Shadow Paging Recovery Technique.

11. (a) Explain Deadlock.(b) Explain Timestamp based protocol for concurrency control.

12. (a) Explain Starvation.

(b) Explain Two phase locking protocol.

13. (a) Explain Checkpoints.

(b) What are the types of failures? Explain the concept of recovery also.

14. (a) Explain Shadow Copy.

(b) Explain the concept of log based recovery.

15. (a) Explain De–normalization.

(b) Consider two sets of FDs on the attributes ABCDE

F = { B CD, AD E, B A}

G = {A CDE, B ABC, AD E}Find Whether they are equivalent or not.

Page 3: CT 2 DBMS

8/8/2019 CT 2 DBMS

http://slidepdf.com/reader/full/ct-2-dbms 3/3