Scribd
Upload
125 views

Practice Questions

The document contains 6 practice questions related to database normalization. The questions cover topics like functional dependencies, candidate keys, normal forms (1NF, 2NF, 3NF, BCNF), and decomposing relations. Students are asked to identify normal forms, decompose relations, and determine which functional dependencies hold for given relation schemas and instances.

Uploaded by

Arun Kumar Singh
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
125 views

Practice Questions

The document contains 6 practice questions related to database normalization. The questions cover topics like functional dependencies, candidate keys, normal forms (1NF, 2NF, 3NF, BCNF), and decomposing relations. Students are asked to identify normal forms, decompose relations, and determine which functional dependencies hold for given relation schemas and instances.

Uploaded by

Arun Kumar Singh
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

PRACTICE QUESTIONS

Q1. Consider the following functional dependencies in a database. (GATE-2003)

Date_of_Birth->Age

Age->Eligibility

Name->Roll_number

Roll_number->Name

Course_number->Course_name

Course_number->Instructor

(Roll_number, Course_number)->Grade

What normal form does the relation (Roll_number, Name, Date_of_birth, Age) follow? Give reasons
for your answer.

Q2. The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following
FDs: name,courseNo->grade

rollNo,courseNo->grade

name->rollNo

rollNo->name

Determine the highest normal form of this relation schema. Give reasons for your answer.(GATE-
2004)

Q3. The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and
pincode. For any pincode,there is only one city and state. Also, for any given street, city and state,
there is just one pincode. In normalization terms, determine the highest normal form followed by
relation schema EMPDT1. Give reasons for your answer. (GATE-2004)

Q4. Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold: (GATE-
2008) AB->CD

DE->P

C->E

P->C
B->G The relation schema R is

(a) in BCNF

(b) in 3NF, but not in BCNF

(c) in 2NF, but not in 3NF

(d) not in 2NF

Give reasons for your answer.

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

Book (Title, Author, Catalog_no, Publisher, Year, Price)

Collection (Title, Author, Catalog_no)

With 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

Give reasons for your answer. (GATE-2008)

Q6. Question 1 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). c. If the relation is not in BCNF, decompose it until it
becomes BCNF. At each step, identify a new relation, decompose and re-compute the keys and the
normal forms they satisfy

Q7. Question 2 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). c. If the relation is not in BCNF, decompose it until it becomes
BCNF. At each step, identify a new relation, decompose and re-compute the keys and the normal
forms they satisfy.

Q1. Consider a relation R with five attributes ABCDE. You are given the following
dependencies:
A →B, BC→E, and ED →A.
List all candidate keys.
Q2. Consider the relation Relation for Q2
a) List all the functional dependencies that this relation instance
X Y Z
satisfies.
x1 y1 z1
b) Assume that the value of attribute Z of the last record in the relation
x1 y1 z2
is changed from z3 to z2. Now list all the functional dependencies that
this relation instance satisfies.
x2 y1 z1
Q3. Suppose that we have the following three tuples in a legal instance of a x2 y1 z3
relation schema S with three attributes ABC (listed in order): (1,2,3), (4,2,3), and(5,3,3).
a) Which of the following dependencies can you infer does hold or not hold over
schema S?
i. A → B,
ii. BC → A,
iii. B → C
b) Can you identify any dependencies that hold over S?
Q4. Find Candidate Keys from following set of FDs
a) C →D, C →A, B →C
b) B →C, D →A
c) ABC →D, D →A
d) A →B, BC →D, A →C
e) AB →C, AB →D, C →A, D →B
Q5. Let relation R(A,B,C,D,E,F,G,H) satisfy the following functional dependencies:

Which of the following FDs are satisfied or not satisfied by R? Give proper reasoning of
your answer.

a)

b)

c)

d)

e)
Q6. Suppose R(A,B,C) has only one tuple (1,1,1) and it must always satisfy the following FDs
B→C and A→B then which of the following will be allowed and which are not. Give reason
for your answer.
a) (0,0,0)
b) (0,1,0)
c) (1,0,0)
d) (1,1,2)
e) (2,1,2)
f) (2,2,2)

You might also like