Scribd
Upload
19 views2 pages

Question Bank 3

The document contains questions about database normalization, functional dependencies, concurrency control, and transactions. It asks about normal forms, functional dependencies, concurrency issues like deadlocks, and transaction concepts like schedules and serialization.

Uploaded by

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

Question Bank 3

The document contains questions about database normalization, functional dependencies, concurrency control, and transactions. It asks about normal forms, functional dependencies, concurrency issues like deadlocks, and transaction concepts like schedules and serialization.

Uploaded by

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

Module 4 Question Bank

1. What is functional dependency? And its types.


2. Define normal form. Explain first, second, and third normal forms with suitable
examples.
3. What is normalization? Mention its need.
4. Define Boyce-Codd normal form. How does it differ from 3NF? Why is it considered a
stronger form of 3NF?
5. What is multivalued dependency? Explain fourth normal form with example. When is it
violated? When is it typically applicable?
6. Write algorithm to find the closure of a set of functional dependencies? Illustrate with an
example.
7. Explain the properties of relational decomposition.
8. What is a minimal set of functional dependencies and write algorithm? Example

Problems( any of these kind)


1. Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional
dependencies F = {{A, B}→{C}, {A}→{D, E}, {B}→{F}, {F}→{G, H}, {D}→{I, J}}.
What is the key for R? Decompose R into 2NF and then 3NF relations. And find whether
decomposition is lossless join decomposition.
2. Consider a relation R(A, B, C, D, E) with the following dependencies:

Is AB a candidate key of this relation? If not, is ABD? Explain your answer.


3. Consider the following relation:
A B C TUPLE#
10 b1 c1 1
10 b2 c2 2
11 b4 c1 3
12 b3 c4 4
13 b1 c1 5
14 b3 c4 6
Given the previous extension (state), which of the following dependencies may hold in
the above relation? If the dependency cannot hold, explain why by specifying the
tuples that cause the violation.

4. Consider R=(A1,A2,A3,A4,A5) and a set of FD={A1A3A5, A5A1A4,A3A4A2}


determine the decomposition D={R1,R2,R3}, R1={A1,A2,A3,A5}, R2={A1,A3,A4}
and R3={A4,A5} is lossless join decomposition.
5. Problems to find
a). candidate key
b). closure set
c). minimal cover of F
d). equivalence of functional dependency
e). lossless join decomposition
f) to find normal form and decompose
Module 5
1. Discuss why concurrency control is needed, and give informal examples.
2. Discuss the different types of failures. What is meant by catastrophic failure?
3. Draw a state diagram and discuss the typical states that a transaction go through.
4. Discuss desirable properties of transactions.(ACID)
5. What is a schedule and give its types?
6. Explain conflict serializable schedule with an example.
7. What is the two-phase locking protocol? What are some variations of the two-phase
locking protocol?
8. Discuss the problems of deadlock and starvation, and the different approaches to
dealing with these problems.
9. Discuss the UNDO and REDO operations and the recovery techniques that use each.
10. List and explain protocols for deadlock prevention.
11. Write short note on Timestamp Ordering Algorithm for Concurrency Control.
Problems(any of these kind)
1. Which of the following schedules is (conflict) serializable? For each serializable
schedule, determine the equivalent serial schedules.
a. r1(X); r3(X); w1(X); r2(X); w3(X);
b. r1(X); r3(X); w3(X); w1(X); r2(X);
c. r3(X); r2(X); w3(X); r1(X); w1(X);
d. r3(X); r2(X); r1(X); w3(X); w1(X);
2. Consider transactions T1, T2, and T3, and schedules S1 and S2 given below. Draw
serializability (precedence) graphs for S1 and S2, and state whether each schedule is
serializable or not. If a schedule is serializable, write 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