Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 742 |
Consider the relation scheme R(A,B,C,D) with following FD set F={A → CE, B → D, AE → D}, Identify the highest normal form satisfied by the relation R
| 2NF | |
| BCNF | |
| 3NF | |
| 1NF |
Question 742 Explanation:
FD set F={ A→CE, B→D, AE→D }
AB+={A,B,C,D,E} it clearly shows that right side, there is no B. So, definitely candidate key require B.
→ The functional dependency B→D violates 2NF requirement. It is a partial dependency, D is partially dependent on B, where B is a proper subset of a candidate key.
AB+={A,B,C,D,E} it clearly shows that right side, there is no B. So, definitely candidate key require B.
→ The functional dependency B→D violates 2NF requirement. It is a partial dependency, D is partially dependent on B, where B is a proper subset of a candidate key.
Correct Answer: D
Question 742 Explanation:
FD set F={ A→CE, B→D, AE→D }
AB+={A,B,C,D,E} it clearly shows that right side, there is no B. So, definitely candidate key require B.
→ The functional dependency B→D violates 2NF requirement. It is a partial dependency, D is partially dependent on B, where B is a proper subset of a candidate key.
AB+={A,B,C,D,E} it clearly shows that right side, there is no B. So, definitely candidate key require B.
→ The functional dependency B→D violates 2NF requirement. It is a partial dependency, D is partially dependent on B, where B is a proper subset of a candidate key.
Subscribe
Login
0 Comments