1. Which normal form is considered adequate for normal relational database design?

(a) 2 NF (b) 5 NF
(c) 4 NF (d) 3 NF
2. Let R = (a, b, c, d, e, f) be a relation scheme with the following dependencies c → f, e → a,
ec → d. a → b. Which of the following is a key for R?
(a) CD (b) EC
(c) AE (d) AC
3. Consider a schema R(A, B, C, D) and functional dependencies A (fd) B and C (fd) D. Then
the decomposition of R into R1 (AB) and R2(CD) is
(a) dependency preserving and lossless join
(b) lossless join but not dependency preserving
(c) dependency preserving but not lossless join
(d) not dependency preserving and not lossless join
4. Relation R with an associated set of functional dependencies, F, is decomposed into
BCNF. The redundancy (arising out of functional dependencies) in the resulting set of
relations is
(a) Zero (b) More than zero but less than that of an
equivalent 3NF decomposition
(c) Proportional to the size of F+ (d) Indeterminate
5. Which one of the following statements about normal forms is FALSE?
(a) BCNF is stricter than 3NF
(b) Lossless, dependency-preserving decomposition into 3NF is always possible
(c) Lossless, dependency-preserving decomposition into BCNF is always possible
(d) Any relation with two attributes is in BCNF
6. A table has fields Fl, F2, F3, F4, F5 with the following functional dependencies F1 → F3
F2→ F4 (F1 . F2) → F5 In terms of Normalization, this table is in
(A) 1 NF (B) 2 NF
(C) 3 NF (D) none
7. Which of the following is TRUE?
(A) Every relation in 3NF is also in BCNF
(B) A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent
on every key of R
(C) Every relation in BCNF is also in 3NF
(D) No relation can be in both BCNF and 3NF
8. The Maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key
is_____
9. Consider the relation scheme R = (E,F,G,H,I,J,K,L,M,N) and the set of functional
dependencies {{E,F} → {G}, {F} → {I, J}, {E, H} → {K, L}, {K} → {M}, {L} → {N}} on R. What is the
key for R ?
A) {E, F}
B) {E, F, H}
C) {E, F, K, L}
D) {E}
10. A Prime Attribute a relation scheme R is an attribute that appears
(A) in all candidate keys of R.
(B) in some candidate key of R.
(C) in a foreign key of R.
(D) only in the primary key of R.
11. State True or False with reason There is always a decomposition into Boyce-Codd normal
form (BCNF) that is lossless and dependency preserving.
12. Consider the relation scheme R(A, B, C) with the following functional dependencies:
A, B → C, C → A
(a) Show that the scheme R is the Third Normal Form (3NF) but not in Boyce- Code
Normal Form (BCNF).
(b) Determine the minimal keys of relation R.
13. For a database relation R(a,b,c,d), where the domains of a, b, c, d include only atomic
values, only the following functional dependencies and those that can be inferred from
them hold: a→c b→d
This relation is:
(a) in first normal form but not in second normal form
(b) in second normal form but not in third normal form
(c) in third normal form
(d) None of the above
14. Let R (a, b, c) and S(d, e, f) be two relations in which d is the foreign key of S that refers
to the primary key of R. Consider the following four operations R and S
(a) Insert into R (b) Insert into S
(c) Delete from R (d) Delete from S
Which of the following is true about the referential integrity constraint above?
(a) None of (a), (b), (c) or (d) can cause its violation
(b) All of (a), (b), (c) and (d) can cause its violation
(c) Both (a) and (d) can cause its violation
(d) Both (b) and (c) can cause its violation
15. Consider the following database relations containing the attributes
Book – id
Subject – Category – of – book
Name – of – Author
Nationality – of – Author
With book – id as the primary key.
(a) What is the highest normal form satisfied by this relation?
(b) Suppose the attributes Book – title and Author – address are added to the relation,
and the primary key is changed to {Name – of – Author, Book – title}, what will be the
highest normal form satisfied by the relation?
16. Consider the schema R = (S T U V) and the dependencies S → T, T → U. U → V and V → S.
Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 = Ø. The decomposition is
(a) not in 2NF
(b) in 2NF but not 3NF
 (c) in 3NF but not in 2NF
(d) in both 2NF and 3NF
17. Given the following relation instance

Which of the following functional dependencies are satisfied by the instance?

(a) XY → Z and Z → Y
(b) YZ → X and Y → Z
(c) YZ → X and X → Z
(d) XZ → Y and Y → X
18. Which one of the following statements if FALSE?
(A) Any relation with two attributes is in BCNF
(B) A relation in which every key has only one attribute is in 2NF
(C) A prime attribute can be transitively dependent on a key in a 3 NF relation.
(D) A prime attribute can be transitively dependent on a key in a BCNF relation.
19. Consider the following relational schemes for a library database:
Book (Title,Author,Catalog_ no, Publisher, Year, Price)
Collection (Title,Author,Catalog_ no)
with in the following functional dependencies:
I. Title Author → Catalog_no
II. Catalog_no → Title Author Publisher Year
III. Publisher Title Year → Price
Assume {Author, Title} is the key for both schemes. Which of the following statements is
true?
(A) Both Book and Collection are in BCNF
(B) Both Book and Collection are in 3NF only
(C) Book is in 2NF and Collection is in 3NF
(D) Both Book and Collection are in 2NF only
20. Let R (A, B, C, D) be a relational schema with the following functional dependencies:
A → B, B → C,
C → D and D → B.
The decomposition of R into
(A, B), (B, C), (B, D)
(A) gives a lossless join, and is dependency preserving
(B) gives a lossless join, but is not dependency preserving
(C) does not give a lossless join, but is dependency preserving
(D) does not give a lossless join and is not dependency preserving
21. Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional depen-
dencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G. The relational
 schema R is
(A) in BCNF
(B) in 3NF, but not in BCNF
(C) in 2NF, but not in 3NF
(D) not in 2NF
22. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values.
F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that
F+ is exactly the set of FDs that hold for R.
How many candidate keys does the relation R have?
(A) 3 (B) 4
(C) 5 (D) 6
23. Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values.
F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that
F+ is exactly the set of FDs that hold for R.
The relation R is
(A) in 1NF, but not in 2NF. (B) in 2NF, but not in 3NF.
(C) in 3NF, but not in BCNF. (D) in BCNF.
24. Given the following two statements:
S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.
S2: AB→C, D→E, E→C is a minimal cover for the set of functional dependencies AB→C,
D→E, AB→E, E→C.
Which one of the following is CORRECT?
(A) S1 is TRUE and S2 is FALSE. (B) Both S1 and S2 are TRUE.
(C) S1 is FALSE and S2 is TRUE. (D) Both S1 and S2 are FALSE.
25. Let R= (A, B, C, D, E, F) be a relation scheme with the following dependencies: C->F, E-
>A, EC->D, A->B. Which of the following is a key for R?
(a) CD (b) EC (c) AE (d) AC
26. From the following instance of a relational schema R(A, B, C), we can conclude that:
----------
A B C
----------
1 1 1
1 1 0
2 3 2
2 3 2
----------
(a) A functionally determines B and B functionally determines C
(b) A functionally determines B and B does not functionally determine C
(c) B does not functionally determine C
(d) A does not functionally determine B and B does not functionally determine C
27. Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional
dependencies hold: {A–>B, BC–>D, E–>C, D–>A}. What are the candidate keys of R?
(a) AE, BE (b) AE, BE, DE
(c) AEH, BEH, BCH (d) AEH, BEH, DEH
28. In a schema with attributes A, B, C, D and E, following set of functional dependencies are
given: A->B A->C CD->E B->D E->A
Which of the following functional dependencies is NOT implied by the above set?
(a) CD->AC (b) BD->CD (c) BC->CD (d) AC->BC
29. The following functional dependencies are given:
AB->CD, AF->D, DE->F, C->G , F->E, G->A
Which one of the following options is false?
(a) CF+ = {ACDEFG} (b) BG+ = {ABCDG}
(c) AF+ = {ACDEFG} (d) AB+ = {ABCDFG}
30. Consider the relation X(P,Q,R,S,T,U)X(P,Q,R,S,T,U) with the following set of functional
dependencies
F={{P,R}→{S,T},{P,S,U}→{Q,R}}F={{P,R}→{S,T},{P,S,U}→{Q,R}}
+ +
Which of the following is the trivial functional dependency in F , Where F is closure
of f?
(a) {P,R} → {ST} (b) {P,R} → {R,T} (c) {P,S} → {S} (d) {P,S,U} → {Q}
31. A prime attribute of a relation scheme RR is an attribute that appears
(a) In all candidate keys of R (c) In a foreign key of R
(b) In some candidate keys of R (d) Only in Primary Key of R
32. Let the set of functional dependencies F = {QR → S, R → P, S → Q}
hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into
two schemas Y and Z, where Y = (PR) and Z = (QRS).
Consider the two statements given below.
I. Both Y and Z are in BCNF
II. Decomposition of X into Y and Z is dependency preserving and lossless
Which of the above statements is/are correct?
(a) I only (c) II only
(b) Neither I nor II (d) Both I and II
33. Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected
by an m : n relationship R12. E1 and E3 are connected by a 1 : n (1 on the side of E1 and
n on the side of E3) relationship R13. E1 has two single-valued attributes a11 and a12 of
which a11 is the key attribute. E2 has two single-valued attributes a21 and a22 of which
a21 is the key attribute. E3 has two single-valued attributes a31 and a32 of which a31 is
the key attribute. The relationships do not have any attributes. If a relational model is
derived from the above ER model, then the minimum number of relations that would be
generated if all the relations are in 3NF is _______.
34. Given the following two statements:
S1: Every table with two single-valued attributes is in 1NF,2NF,3NFand BCNF.
S2: AB→C,D→E,E→CAB→C,D→E,E→C is a minimal cover for the set of functional
dependencies AB→C,AB→C, D→E,AB→E,E→C.D→E,AB→E,E→C.
Which one of the following is CORRECT?
(a) S1 is True and S2 is False (c) Both S1 and S2 are True
(b) S1 is False and S2 is True (d) Both S1 and S2 are False
35. The following functional dependencies are given:
AB → CD, AF → D, DE → F, C → G , F → E, G → A
Which one of the following options is false?
a) CF+ = {ACDEFG} b) BG+ = {ABCDG}
c) AF+ = {ACDEFG} d) AB+ = {ABCDFG}
36.