Scribd
Upload
31 views

Assignment 3

The document contains 12 questions about database management systems (DBMS) concepts related to functional dependencies, attribute closure, candidate keys, and decomposition. The questions ask the student to identify functional dependencies, attribute closures, candidate keys, and determine if proposed decompositions are dependency-preserving and lossless, using given relation schemas and sets of functional dependencies.

Uploaded by

Yuvraj
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Assignment 3

The document contains 12 questions about database management systems (DBMS) concepts related to functional dependencies, attribute closure, candidate keys, and decomposition. The questions ask the student to identify functional dependencies, attribute closures, candidate keys, and determine if proposed decompositions are dependency-preserving and lossless, using given relation schemas and sets of functional dependencies.

Uploaded by

Yuvraj
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DBMS

ASSIGNMENT 3

Q.1 What is functional Dependency? How to find functional dependencies for a


relation?

Q.2 What is attribute closure? How to find attribute closure of an attribute set?

Q.3 How to find Candidate Keys and Super Keys using Attribute Closure?

Q.4 Consider the relation schema R(A, B, C, D) with functional dependencies A-


>D, B->CD and AC->D.

(i) Find the attribute closure {A}+.


(ii) Find the attribute closure {A, B}+.
(iii) Find the minimum cover (i.e. canonical cover) of the given
functional dependencies.
(iv) List all the candidate key(s) of R.

Q.5 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?

Q.6 What is functional dependency set? How to check whether an FD can be


derived from a given FD set?

Q.7 Explain the types of functional Dependency?

Q.8 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

Q.9 What is prime and non-prime attributes?


Q.10 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?

Q.11 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

Q.12 Consider the relation schema R(A, B, C, D, E, G) with functional


dependencies F = {AB->C, AG->E, B->D, E->G}. Notice F is the minimum cover
of itself.
For each of the following decompositions R(A, B, C, D, E, G), determine whether
it is (a) dependency-preserving, and (b) lossless.
i) {ABC, CDE, EG}
ii) {ABCD, AEG}
iii) {ABCE, BD, AEG}

You might also like