Assignment 3
Topic Normalization
Q1: Consider relation: R = (A, B, C, D, E) with the set of functional dependencies: {CE → D, D → B, C
→ A}.
• Find all candidate keys.
• Identify the best normal form that R satisfies (1NF, 2NF, 3NF).
Q2: Consider relation: R = (A, B, C, D, E, F, G, H, I, J)
with the set of functional dependencies: {AB → C, A → DE, B → F, F → GH, D → IJ}
• Find all candidate keys.
• Identify the best normal form that R satisfies (1NF, 2NF, 3NF).
Q3: Suppose you are given a relation R = (A, B, C, D, E) with the following functional
dependencies: {CE → D, D → B, C → A}.
a. Find all candidate keys.
b. Identify the best normal form that R satisfies (1NF, 2NF, 3NF, or BCNF).
Q4: Suppose you are given a relation R=(A,B,C,D,E) with the following functional dependencies:
{BC → ADE, D → B}.
a. Find all candidate keys.
b. Identify the best normal form that R satisfies (1NF, 2NF, 3NF, or BCNF).
Q5: Suppose you are given a relation R=(A,B,C,D,E) with the following functional
dependencies: BD → E, A → C. Show that the decomposition into R1=(A,B,C) and R2=(D,E)
is lossy. By taking values as given:
A B C D E
1 2 3 4 5
1 8 3 4 4
Q6: Given the following set of functional dependencies for a relation R(A,B,C,D,E,F),
F = {AB → C, DC → AE, E → F}.
a. What are the keys of this relation?
b. Is this relation in BCNF? If not, explain why by showing one violation.
c. Is the decomposition (A,B,C,D) (B,C,D,E,F) a dependency preserving decomposition?
If not, explain briefly.
Q7: Given the below functional dependencies for relation R(A,B,C,D,E), F =
{AB → C, AB → D, D → A, BC → D, BC → E}.
a. Is this relation is in BCNF? If not, show all dependencies that violate it.
b. Is this relation in 3NF? If not, show all dependencies that violate it.
Q8: Given the following set F of functional dependencies for a relation R(A,B,C,D,E,F):
F = {ABC → D, ABD → E, CD → F, CDF → B, BF → D}.
a. Find all keys of R based on these functional dependencies.
b. Is this relation in Boyce-Codd Normal Form? Is it 3NF? Explain your answers.
Q9: Consider the relation R(V, W, X, Y, Z) with functional dependencies {Z → Y, Y →
Z, X → Y, X → V, V W → X}.
a) List the possible keys for relation R based on the functional dependencies above.
b) Show the closure for attribute X given the functional dependencies above.
c) Suppose that relation R is decomposed into two relations, R1(V, W, X) and R2(X,
Y,Z). Is this decomposition a lossless decomposition? Explain your answer.
Q10: Consider a relation R(A, B, C, D) with the set of functional dependencies F = {AB → C,
BC → D, CD → A}. Assume that R is decomposed into R1(A, B, C) and R2(A, C, D). Find whether
the given decomposition is lossless or not.
Q11: Consider a relation R (A, B, C, D) with the following instance;
A B C D
1 1 2 3
1 2 2 3
1 3 2 3
2 4 5 6
5 6 7 8
Which of the following functional dependencies are satisfied by this relation? How?
(a) A → B
(b) A → CD
(c) AB → CD
(d) C → D
(e) B → A
(f) BD → AC
(g) AD → BC
(h) D → B
(i) D → C
(j) C → A
Q12: For the following Student table instance, find all the possible functional dependencies that
are held. Do not include trivial FDs.
[ Schema - Student (Regno, Name, DOB, Phone, Gender, Course_ID, Course_Name, Instructor_ID,
Instructor_Name, Instructor_Office)]
Regno Name DOB Phone Gender CID CName Ins_ID Ins_Name Ins_Office
14M01 Kumar 12-Jan-1996 12345 M C1 DBMS I1 Kesav G123
14M05 Mary 10-Jun-1995 12367 F C1 DBMS I1 Kesav G123
14M07 Ram 10-May-1996 12898 M C1 DBMS I2 Ragav G127
14M01 Kumar 12-Jan-1996 12345 M C3 DS I5 Mani G125
14B01 Revathi 10-Dec-1995 23456 F C3 DS I5 Mani G125
14M09 Steve 23-Oct-1995 34567 M C4 OS I5 Mani G125
14B03 Ramya 20-Jul-1996 23456 F C4 OS I5 Mani G125