Questions On Normalization

Q1.
Let R = (A, B, C, D, E, F) be a relation schema with the following

dependencies: C→F, E→A, EC→D, A→B.
Which of the following is a key of R?
(a) CD (b) EC (c) AE (d) AC
Q2. Consider the relation R (ABCDE):

FD = {A → B, B → C, C → D, D → E}
Find out the highest normal form.
(a) 1NF (b) 2NF (c) 3NF (d) BCNF
Q3. For a database relation R (a, b, c, d) where the domains of a, b, c and

d include only atomic values, only the following functional dependencies
and those that can be inferred from them hold:
{a → c, b → d}
The relation is in ________
(a) First normal form but not in second normal form
(b) Second normal form but not in third normal form
(c) Third normal form
(d) None of the above
Q4. Consider the following relational schemes for a library database:

Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection
(Title, Author, Catalog_no)
within 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
Q5. Consider the following four relational schemas. For each schema, all
non-trivial functional dependencies are listed. The underlined attributes
are the respective primary keys.
Schema I: Registration (rollno, courses)
Field ‘courses’ is a set-valued attribute containing the set of courses a
student has registered for. Non-trivial functional dependency
rollno → courses
Schema II: Registration (rollno, courseid, email)
Non-trivial functional dependencies:
rollno, courseid → email
email → rollno
Schema III: Registration (rollno, courseid, marks, grade)
rollno, courseid, → marks, grade
marks → grade
Schema IV: Registration (rollno, courseid, credit)
rollno, courseid → credit
courseid → credit
Which one of the relational schemas above is in 3NF but not in BCNF?
(a) Schema I
(b) Schema II
(c) Schema III
(d) Schema IV
Q6. 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
Q7. 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) Both I and II
(b) I only
(c) II only
(d) Neither I nor II
Q8. Consider the following dependencies and the BOOK table in a

relational database design. Determine the normal form of the given
relation.
ISBN → Title
ISBN → Publisher
Publisher → Address
(a) First Normal Form (b) Second Normal Form
(c) Third Normal Form (d) BCNF
Q9. Consider a relational table R that is in 3NF, but not in BCNF. Which
one of the following statements is TRUE?
(a) R has a nontrivial functional dependency X→A, where X is not a
superkey and A is a prime attribute
(b) R has a nontrivial functional dependency X→A, where X is not a
superkey and A is a non-prime attribute and X is not a proper subset of
any key
(c) R has a nontrivial functional dependency X→A, where X is not a
superkey and A is a non-prime attribute and X is a proper subset of some
key
(d) A cell in R holds a set instead of an atomic value
Q10. Suppose the following functional dependencies hold on a relation U

with attributes P, Q, R, S, and T:
P → QR
RS → T
Which of the following functional dependencies can be inferred from the
above functional dependencies?
(a) PS → T
(b) R → T
(c) P → R
(d) PS → Q
Ans:
1. B
2. B
3. A
4. C
5. B
6. B
7. C
8. B
9. A
10. A, C, D

Questions On Normalization

Uploaded by

Questions On Normalization

Uploaded by

Q1.

Let R = (A, B, C, D, E, F) be a relation schema with the following

Q2. Consider the relation R (ABCDE):

Q3. For a database relation R (a, b, c, d) where the domains of a, b, c and

Q4. Consider the following relational schemes for a library database:

Q7. Let the set of functional dependencies F= {QR→S, R→P, S→Q}

Q8. Consider the following dependencies and the BOOK table in a

Q10. Suppose the following functional dependencies hold on a relation U

You might also like