2nd Assignment of DBMS
2nd Assignment of DBMS
PART A
PART B
1. Explain insertion, deletion, and modification anomalies.
2. Decompose the schema R=(A,B,C,D,E) in to (A,B,C) and (A,D,E).Also show that this decomposition is a lossless join
decomposition if the following set F of functional dependencies hold:
A BC, CDE,BD,EA
3. What is the need of serializability in transaction processing?
4. How many kinds of locks present in lock-based protocol?
5. What are the different states of transaction? Explain with proper diagram?
6. What do you understand by log-based recovery?
7. Explain ACID property in detail
8. What are the various problems can occur due to Concurrency?
9. What is shadow paging? Explain in details?
10. What are the properties of transaction processing?
11. Explain recoverable schedules briefly?
12. Write a short note on Multi-valued dependencies?
PART C
1. Write a short note on Validation based protocol.
2. How to define a domain constraint? Give an example
3. What is Normalization? Also explain function dependencies with suitable example.
4. Differentiate between 2PL with Strict 2PL protocol.
5. What is graphical form of recoverable schedule?
6. Consider schema R = (A, B, C, G, H, I) and the set F of functional dependencies {A→B, A→C, CG →H, CG→I, B→H}.
Compute the candidate keys of the schema. Compute the closure of the same?.
7. Why must lock and unlock be atomic operations? Explain recovery related data structure in detail?
8. Why use concurrent transaction with recovery process?Explain recovery using with checkpoint?
9. Defined the whole concurrency control types and examples?
10. Describe conflict serializability and view serializability with examples?
11. Consider the schema R=(A,B,C,D,E) with a set of functional dependencies {EDD,ABC,EB,BC} find
canonical cover?
12. Discuss the purpose of BCNF and describe how BCNF different from 3NF?