Scribd
Upload
288 views3 pages

Functional Dependency Practice Set

The document contains 20 practice questions related to database management systems and functional dependencies. The questions test concepts like determining candidate keys, closure of functional dependencies, and checking if relations are in 2nd normal form (2NF) given their attribute sets and functional dependencies. Sample questions include finding the key of a relation given its attributes and functional dependencies, determining the closure of a set of attributes, and identifying whether a relation satisfies 2NF.

Uploaded by

Khusboo Chowdhury
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
288 views3 pages

Functional Dependency Practice Set

The document contains 20 practice questions related to database management systems and functional dependencies. The questions test concepts like determining candidate keys, closure of functional dependencies, and checking if relations are in 2nd normal form (2NF) given their attribute sets and functional dependencies. Sample questions include finding the key of a relation given its attributes and functional dependencies, determining the closure of a set of attributes, and identifying whether a relation satisfies 2NF.

Uploaded by

Khusboo Chowdhury
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Computer Applications for Business

Chapter: Database Management Systems


Practice Set

1. 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?
2. We are given the relation R(A, B, C, D, E). This means that the table R has five columns:
A, B, C, D, and E. We are also given the set of functional dependencies: {A->B, B->C,
C->D, D->E}.

What is {A}+?

3. We are given R(A, B, C, D, E, F). The functional dependencies are {AB->C, BC->AD,
D->E, CF->B}. What is {A, B}+?
4. R(A,B,C,D,E) AND FD: A->B,B->C, C->D, A->E. Find the closure of FD.
5. Let the relation R(A,B,C,D,E,F)
F: B->C, BC->AD, D->E, CF->B. Find the closure of B.
6. Consider a relation R(A,B,C,D,E,F)
F: E->A, E->D, A->C, A->D, AE->F, AG->K.
Find the closure of E or E+

7. Consider a relation R ( A , B , C , D , E , F , G ) with the functional dependencies-


A → BC
BC → DE
D→F
CF → G
What are the candidate keys?
8. Consider the given functional dependencies-
AB → CD
AF → D
DE → F
C→G
F→E
G→A
Which of the following options is false?

[email protected]
(A) { CF }+ = { A , C , D , E , F , G }
(B) { BG }+ = { A , B , C , D , G }

(C) { AF }+ = { A , C , D , E , F , G }
(D) { AB }+ = { A , C , D , F ,G }
9. Given a relation R( A, B, C, D) and Functional Dependency set FD = { AB → CD, B → C
}, determine whether the given R is in 2NF?
10. Given a relation R( P, Q, R, S, T) and Functional Dependency set FD = { PQ → R, S → T
}, determine whether the given R is in 2NF?
11. Given a relation R( P, Q, R, S, T, U, V, W, X, Y) and Functional Dependency set FD = {
PQ → R, PS → VW, QS → TU, P → X, W → Y }, determine whether the given R is in
2NF?
12. Given a relation R( A, B, C, D, E) and Functional Dependency set FD = { A → B, B → E,
C → D}, determine whether the given R is in 2NF?
13. 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?
14. Consider the relation scheme R = {E, F, G, H, I, J, K, L, M, M} 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?
15. Consider a relation- R ( V , W , X , Y , Z ) with functional dependencies-
VW → XY
Y→V
WX → YZ
What are the possible candidate keys for R?
16. Consider a relation- R ( A , B , C , D , E ) with functional dependencies-
A → BC
CD → E
B→D
E→A
Determine whether the given R is in 2NF?

17. Consider a relation- R ( A , B , C ) with the functional dependencies-


A→B
B→C
C→A
Determine whether the given R is in 2NF?

[email protected]
18. A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1->F3
F2->F4
(F1,F2)->F5
Determine whether the given R is in 2NF?
19. Consider the following functional dependencies in a database.
Date_of_Birth->Age Age->Eligibility
Name->Roll_number Roll_number->Name
Course_number->Course_name Course_number->Instructor
(Roll_number, Course_number)->Grade
Determine whether the given R is in 2NF?
20. The relation schema Student_Performance (name, courseNo, rollNo, grade) has the
following FDs:
name,courseNo->grade
rollNo,courseNo->grade
name->rollNo
rollNo->name

Determine whether the given R is in 2NF?

[email protected]

You might also like