Scribd
Upload
81 views2 pages

21CS53 DBMS Iat3 QB

The document outlines the modules for a database management systems course. Module 4 discusses relational database design topics like normalization forms, functional dependencies, and decomposition algorithms. Module 5 covers concurrency control and recovery methods in database systems like locking protocols, timestamps, and logging to support ACID transactions. Sample problems are provided for practice testing serialization, functional dependencies, and concurrency control concepts.

Uploaded by

Kunaljit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views2 pages

21CS53 DBMS Iat3 QB

The document outlines the modules for a database management systems course. Module 4 discusses relational database design topics like normalization forms, functional dependencies, and decomposition algorithms. Module 5 covers concurrency control and recovery methods in database systems like locking protocols, timestamps, and logging to support ACID transactions. Sample problems are provided for practice testing serialization, functional dependencies, and concurrency control concepts.

Uploaded by

Kunaljit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MODULE 4

1) With suitable example, explain Informal Design Guidelines for Relation Schemas. (
study for at least 10 marks)
2) With suitable example, explain 1NF, 2NF, 3NF, 4NF, BCNF, 5NF ( study for at least
10 marks)
3) With suitable example, explain Properties of Relational Decompositions ( study for at
least 10 marks)
4) Explain insertion, deletion, and modification anomalies. Why are they considered
bad?/ List explain different types of update anomalies. ( study for at least 10 marks).
5) List & explain Armstrong’s axioms.
6) Write the algorithm to find minimal cover/canonical cover
7) Explain the algorithm for Dependency-Preserving and Nonadditive (Lossless) Join
Decomposition into 3NF Schemas ( study for at least 10 marks)
8) Explain the algorithm for Nonadditive Join Decomposition into BCNF Schemas (or)
Define non-additive join property of a decomposition and write an algorithm for
testing of non- additive join property. ( study for at least 10 marks)
9) Explain functional dependencies: fully functional dependency, partial functional
dependency, transitive dependency, trivial dependency, multivalued dependency.
10) Problems related to :
i. Finding closure of functional dependency
ii. Finding cover / minimal cover/ canonical cover of functional dependency
iii. Determining whether given set of functional dependencies are equivalent or
not
iv. Finding super key, candidate key, primary key
v. Decomposition of relations by preserving dependency

Sample problems for reference and practice ( Just for reference, may not
get same problems in Exam)

i. Consider the relation schema R(A,B,C,D,E,F) and the functional dependencies


A->B,C->DF,AC->E, D->F. What is the primary key of this relation R? What is its
highest normal form? Preserving the dependency, decompose R into third normal form.

ii. Write the algorithm to find the minimal cover for a sets of FD’s.
Consider R={A,B,C,D,E,F} .FD’s {A->C,AC->D,E->AD,E->H} .
Find the irreducible cover/minimal cover for this set of FD’s.

iii. Given below are two sets of FD’s for a relation R(A,B,C,D,E). Are they
equivalent?
F={A->C,AC->D,E->AD,E->H} and
G={A->CD,E->AH}
MODULE 5
1) Why concurrency control and recovery are needed in DBMS? List & Explain the
types of problem that may occur when 2 transactions run concurrently. (or) What are
the anomalies that can occur due to interleaved execution? (or) What are the types of
problems that may occur when 2 transactions run concurrently? ( study for at least 10
marks)
2) With a neat diagram explain transition diagram of a transaction
3) Briefly discuss on the two-phase locking protocol used in concurrency control. How
does it guarantee serializability? ( study for at least 10 marks)
4) Explain different types of Locks used in concurrency control.
5) Explain Basic time stamping algorithm for Concurrency Control ( study for 8 marks)
6) Explain multi version concurrency control protocols. ( study for 8 marks)
7) Write short notes on the following ( study for at least 7 -8 marks)
a. transaction rollback and cascading rollback.
b. shadow paging/ Explain how Shadow Paging helps to recover from transaction
failure/ Write a short note on Shadow paging
c. NO-UNDO/REDO Recovery Based on Deferred Update
d. Recovery Techniques Based on Immediate Update
8) List and explain ACID Properties
9) Write a short Note on System Log
10) Briefly explain Transaction Support in SQL
11) Problems related to Testing conflict serializability of a Schedule using precedence
graph ( Practice the problems )

Sample problems for reference and practice ( Just for reference, may not
get same problems in Exam)

i. Check whether given schedule is serializable or not using precedence graph.


Explain with algorithm.
a. S1: R1(X) R2(Z) R1(Z) R3(X) R3(Y) W1(X) W3( Y) R2(Y) W2(Z) W2(Y)

ii. Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given
below. Draw the serializability (precedence) graphs for S1 and S2, and state whether
each schedule is serializable or not. If a schedule is serializable, write down the
equivalent serial schedule(s).
T1: r1 (X); r1 (Z); w1 (X);
T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);
T3: r3 (X); r3 (Y); w3 (Y);
S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);
S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);

You might also like