2CSBS3105 DBMS Assignment 2 2024
2CSBS3105 DBMS Assignment 2 2024
6 Find canonical cover for a relation R(A,B,C,D) having some attributes and below 4-U
are mentioned functional dependencies. FD ={B -> A, AD -> C, C -> ABD}
7 Enlist and explain the basic steps in Query Processing. 3-A
8 Discuss Lossy and Lossless decomposition with proper example. 4-U
9 Examine the Highest normal form for the given Relation R (A, B, C, D) with 4-R
Functional dependencies {F: A→B, B→C, C→BD}. If the relation is not in 3NF
then use Normalization to bring the relation in 3NF.
10 Consider the relation R = {A, B, C, D, E, F, G, H, I, J} and the set of 4-E
functional dependencies
F={{A, B} → C, A → {D, E}, B → F, F →{G, H}, D →{I, J}}
What is the key for R? Decompose R into 2NF, then 3NF relations.
11 Explain ACID Properties of Transaction. 2-U