Relational Model and Normal Forms - DPP 02
Relational Model and Normal Forms - DPP 02
GATE
CS & IT
Database Management System DPP: 2
Q4 Assume a relation R (P, Q, R, S, T) with the set of Q8 Consider the following FD sets:
functional dependencies {P→Q, Q→R, R→Q and S1 = {P → R, PR → S, T → PS, T → U}
Q→T}. How many candidate keys are possible in S2 = {P → S, QR → PS, R → Q, T → P, T → S, T → U}
R? S3 = {P → S, R → P, R → Q, T → PU}
Which of the following sets is equivalent?
Q5 Consider a schema with attributes A, B, C, D & E
(A) S1 ≡ S2
following set of functional dependencies are
(B) S2 ≡ S3
given,
(C) S1 ≡ S3
A→B
(D) S1 ≡ S2 ≡ S3
A→C
CD→E Q9 Assume the relation R that has eight attributes
B→D ABCDEFGH.
E→A Let A = {CH→G, A→BC, B→CFH, E→A, F→EG} is a
Which of the following functional dependencies set of functional dependencies (FD). How many
is implied by the above set? candidates keys does the relation R have?
1 of 2 19/08/24, 10:54
GATE_DPP 2
GATE
Answer Key
Q1 (A) Q6 (C)
Q2 5 Q7 (B)
Q3 (D) Q8 (B)
Q4 1 Q9 4
2 of 2 19/08/24, 10:54