B.TECH.

(SEM V) ASSIGNMENT 3
2023-24
DATABASE MANAGEMENT SYSTEM

Time: 3 Hours Total Marks: 100

Note: Attempt all Sections.

SECTION A
1. Attempt all questions in brief. 2x10 = 20
a. What is meant by trivial and non-trivial functional dependencies?
b. When are two sets of functional dependencies said to be equivalent?
c. Define the following: i. Full functional dependency ii. Partial dependency
d. What is transitive dependency? Name the normal form which is based on the concept of
transitive dependency.
e. What are the different types of anomalies associated with database?
f. Are normal forms alone sufficient as a condition for a good schema design? Explain
g. Define 2 NF along with suitable example.
h. Why do we normalize database?
i. How dependency preservation can be achieved?
j. Define the closure of an attribute set.

SECTION B
2. Attempt any three of the following: 10x3 = 30
a. What do you mean by lossless decomposition? Explain with suitable example how functional
dependencies can be used to show that decompositions are lossless
b. Define normal forms. Explain 1NF, 2NF, 3NF and BCNF with suitable example.
c. Consider the universal relational schema R (A, B, C, D, E, F, G, H, I, J) and a set of
following functional dependencies. F = {AB  C, A  DE, B  F, F  GH, D  IJ}
determine the keys for R? Decompose R into 2nd normal form.
d. Consider the relation R(A,B,C,D,E,F) and the FDs ABC→DE, ABC→D, DE→ABCE,
E→C. Decompose the relation by considering the given set of FDs into BCNF relation.

SECTION C
3. Attempt any one part of the following: 10x1 = 10

a. Write short notes of the following: i. MVD or JD ii. Normalization with advantages

b. Define partial functional dependency. Consider the following two steps of functional
dependencies F = {A  C, AC  D, E  AD, E  H} and G = {A  CD, E  AH}. Check
whether or not they are equivalent.

4. Attempt any one part of the following: 10 x1 = 10

 a. Define minimal cover. Suppose a relation R(A, B, C) has FD set F = {A  B, B  C, A 
C, AB  B, AB  C, AC  B} convert this FD set into minimal cover.

b. Write the difference between 3NF and BCNF. Find the normal form of relation R(A, B, C,
D, E) having FD set F= {A  B, BC  E, ED  A}.

5. Attempt any one part of the following: 10x1 = 10

a. What is functional dependency? Describe the inference rules for functional dependencies.

b. Given the following set of FDs on schema R (V,W,X,Y,Z) {Z→V, W→Y, XY→Z,
V→WX}State whether the following decomposition are loss-less-join decompositions or not.
(i) R1=(V,W,X) , R2=(V,Y,Z) (ii) R1=(V,W,X), R2=(X,Y,Z)

6. Attempt any one part of the following: 10x1 = 10

a. Explain the procedure of calculating the Canonical Cover of a given Functional Dependency
Set with suitable example.
b. Consider a relation R(A,B,C,D,E) with set F= { A→CD, C→B,B→AE} What are the prime
attributes of this Relation and Decompose the given relation in 3NF.

7. Attempt any one part of the following: 10x1 = 10

a. Explain the fourth normal form by taking a suitable database schema.

b. Consider schema R = (A, B, C, G, H, I) and the set F of functional dependencies {A → B, A
→ C, CG → H, CG → I, B → H}. Compute the candidate keys of the schema.