1.

Find if a given functional dependency is implied from a set of Functional Dependencies:

For: A→ BC, CD→ E, E→ C, D→ AEH, ABH→ BD, DH→ BC

a. Check: BCD→ H

b. Check: AED→C

2.Find Super key and Candidate Key using Functional Dependencies:

a. Relational Schema R(ABCDE). Functional dependencies: AB→ C, DE→ B, CD→ E

b. Relational Schema R(ABCDE). Functional dependencies: AB→ C, C→ D, B→ EA

3.Find Prime and Non Prime Attributes using Functional Dependencies:

a. R(ABCDEF) having FDs {AB→C, C→D, D→E, F→B, E→F}

b. R(ABCDEF) having FDs {AB→ C, C→ DE, E→ F, C→ B}

4.Check the Equivalence of a Pair of Sets of Functional Dependencies:

Consider the two sets F and G with their FDs as below :

a. F : A→ C, AC→ D, E→ AD, E→ H

b. G: A→ CD, E→ AH

5.For a relation schema R = (A, B, C, D, E), consider the following set of functional dependencies;

F = {A → BC, CD → E, B → D, E → A} Using the functional dependencies compute the canonical

cover Fc.

6.Check if the decomposition of R into D is lossless:

R(ABCDEG): F = {AB→ C, AC→ B, AD→ E, B→ D, BC→ A, E→ G}

a. D1 = R1(AB), R2(BC), R3(ABDE), R4(EG)

b. D2 = R1(ABC), R2(ACDE), R3(ADG)

7.Check whether the decomposition of R into D is preserving dependency:

a.R(ABCD): F = {A→ B, B→ C, C→ D, D→ B}. D = {AB, BC, BD}

b.R(ABCDE): F = {A→ BC, CD→ E, B→ D, E→ A}. D = {ABCE, BD}

8. Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.
T1: r1(X);r1(Z);w1(X);w1(Z)
T2: r2(Y);r2(Z);w2(Z)
T3: r3(Y);r3(X);w3(Y)
S1: r1(X);r3(Y);r3(X);r2(Y);r2(Z);w3(Y);w2(Z);r1(Z);w1(X);w1(Z)
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
Analyze which one of the schedules is conflict-serializable?

9. Consider the following transactions with data items P and Q initialized to zero:
T1: read(P);
read(Q);
If P=0 then Q:=Q+1;
write(Q);
T2: read(Q);
 read(P);
If Q=0 then P:=P+1;
write(P);
Solve and find any non-serial interleaving of T1 and T2 for concurrent execution leads to a serializable
schedule or non-serializable schedule. Explain?
10. Consider the attribute set R = ABCDEGH and the FD set F = {AB → C, AC → B, AD → E, B → D, BC →
A, E → G}.
1. For each of the following attribute sets, do the following:
(i) Name the strongest normal form that is not violated by the relation containing these
attributes.
(ii) Decompose it into a collection of BCNF relations if it is not in BCNF.
(a) ABC, (b) ABCD, (c) ABCEG, (d) DCEGH, (e) ACEH

11. The relation schema student performance

(name, courseno, rollno, grade) has the
dependencies
rollno, courseno → grade
name, courseno → grade
name → rollno
rollno → name
find the highest normal form for the relation?

12.Consider the relational shema given below

Book (title, author, catalogno, publisher, year, price) and functional dependencies
Title, author → catalogno
Catalogno → title author publisher year
Publisher title year → price
Assume (author, title) is a key for the above schema. what is the highest normal form for the above
relation.
13. Check whether the given schedule S is view serializable or not

14. Check whether the given schedule S is conflict serializable and recoverable or not?