ASSIGNMENT NO.

03 (UNIT-III)
Course Outcome-3, Session 2023-24
SUB: Data Base Management Systems (KCS-501)

Q.1. Compute the closure of the following set of FD for relation schema R(ABCDE) =
{A→BC, CD→E, B→D, E→A} List the candidate keys for R.
Decompose R into 2nd Normal form
Q.2 Consider Project table, explain the criteria for defining third normal form. Define
Boyce-Codd normal forms. How does it differ from third normal form?

Q.3 Discuss lossless join and dependency preservation. Consider the scheme S=(V,W,X,Y,Z)
Suppose the following FD hold: {Z→V, W→Y, XY→Z,V→WX}. State whether the
following decomposition of scheme S is lossless join decomposition justifies your answer.
A) S1=(V,W,X) S2=(V,Y,Z)
B) S1=(V,W,X) S2=(X,Y,Z)

Q.4 Find out the attribute closure of following relations:

(i) R(ABCDEFG) = {AB→CD, AF→D, DE→F, C→G, F→E, G→A} than find
the closure CF+, BG+, AF+ and AB+.
(ii) X→Y and Y→Z than find X+, Y+, Z+ and XY+.
(iii) A→B, B→C and AC→D than find A+, B+, C+ and D+.

Q.5 Explain the following definitions with suitable example:

(i) Functional dependency preserving decomposition.
(ii) Lossless join decomposition.

Q. 6 Find out the attribute closure of following relations:

a) R(ABCDEFG) = {ABCD, AFD, DEF, CG, FE, GA} than find the closure
CF+ , BG+ , AF+ and AB+ .
b) XY and YZ than find X+ , Y+ , Z + and XY+ .
c) AB, BC and ACD than find A+ , B+ , C+ and D+ .

Q.7 Find out the candidate keys of following relations:

a) R(ABCDE) = {BD, AE, EB, DE}.b. R(ABCD) = {AC, BA}.
b) R(ABCDEF) = {ABC, DE, CD, EF, FB}.
c) R(ABCDEF) = {ABC, CDE, EF, FA}.
d) R(ABCDEF) = {ABC, DAE, CD, EF, FB}.

Q.8 Explain the following definitions with suitable example:

 a) Functional dependency preserving decomposition.

b) Lossless join decomposition.

Q.9 Find out the highest normal form of the following relations:
a) R(ABCDE) = {ABC, CD, BF}.
b) R(ABCD) = {ABC, BCD}.
c) R(ABCDE) = {ABCD, DA, ADE}.
Q.10 Find out the highest normal form of the following relations and decompose the relations
till highest normal form.
a) R(ABCDE) = {ABC, CD, DE, EA}.
b) R(ABCDEF) = {ABC, CDE, EF, FB}.
c) R(ABCDE) = {ABC, CD, BE}.
Q.11. If all the attributes are candidate keys than what is the maximum normal form possible?
Q.12. How many Non-trivial multi values functional dependencies are possible, if relation have
only two attributes?
Q.13 If R(ABCD) = {ABCD, AB, AC}, find the highest normal form.
Q.14 If R(ABCDEGH) = {ABC, ACB, ADE, BCA, BG, BD}, than answer the
following questions.
a) Find the minimal cover.
b) Find the highest normal form.
c) Decompose the relation up till highest normal form

Q.15. If all the candidates are simple in a given relation than what is the maximum normal form
possible?
Q.16 Explain the definition and integrity constraints of following keys:

a) Super Key
b) Candidate Key
c) Primary Key
d) Foreign Key