Scribd
Upload
3 views

Tutorial 3

Uploaded by

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

Tutorial 3

Uploaded by

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

Tutorial-3

Subject: Database Management System


Subject code: BCS 501
Faculty Name: Session: 2024-25
Section: For all

I. Consider the given relation R (ABCDE) with the set of the following function dependencies: F
= {A→BC, B→D, CD→E, E→A} Find the closure of the E. (BCS501.3,K3)
II. Consider the given relation R (ABCDEF) with the set of the following function dependencies:
a. F = {A→E, B→D, C→DE, BD→F} Find the closure of the BCD (BCS501.3,K3)
III. For the relation R(ABCDEFGH) with FD's= {CH->G, A->BC, B->CHF, E->A, F->EG such
that F+ is exactly the set of FDs that hold for R.} Consider the FDs given in above question.
The relation R is in which normal form? (BCS501.3,K3)
IV. Consider a relation R(A, B, C, D, E) with the following three functional dependencies.𝐴𝐵 →
𝐶; 𝐵𝐶 → 𝐷; 𝐶 → 𝐸;Identify the number of super keys in the relation R (BCS501.3,K3)
GATE2022
V. Consider a relation R(A, B, C, D, E,H) with the following three functional dependencies.𝐴 →
B; 𝐵𝐶 → 𝐷; E→ C, D→ A Identify the candidate key of relation R .(BCS501.3,K3)
GATE2005
VI. Discuss attribute semantics as an informal measure of goodness for a relation schema?
(BCS501.3,K2)
VII. What is meant by the attribute preservation condition on decomposition? (BCS501.3,K1)
VIII. Define fourth normalization, when is it violated? Why is it useful? (BCS501.3,K1)
IX. Define join dependencies and fifth normal form. Why 5NF is also called PJNF? (BCS501.3,K1)
X. Why is the domain-key normal form known as ultimate normal form (BCS501.3,K1)

XI. State True or False with reason. There is always a decomposition into Boyce-
codd normal form (BCNF) that is lossless and dependency preserving.
(GATE 1994) (BCS501.3,K1)
XII. 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 and Z where Y = (PR) and Z = (QRS). Consider the two
statements given below: (GATE 2019) (BCS501.3,K2)
I. Both Y and Z are in BCNF
II. Decomposition of X into Y and Z is dependency preserving and a lossless.
Which of the above statements is/are correct?

You might also like