Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024Database-Management-System
| Question 738 |
Consider the relation schema R(A,B,C,D) with following functional dependency set F={A→ BC, C→ D}; The relation R is in ___
| 2NF | |
| BCNF | |
| 3NF | |
| 1NF |
Question 738 Explanation:
Given, functional dependencies are F={A→ BC, C→ D}
Finding candidate key of given relation is relation is
A+={A,B,C} because we don’t have an A element in right hand side.
A→ BC dependency A is the candidate key and also part of FD. So, it is lossless.
C→ D is following Transitive dependency. So, it never become 3NF.
According to given choices, A is the correct choice.
Finding candidate key of given relation is relation is
A+={A,B,C} because we don’t have an A element in right hand side.
A→ BC dependency A is the candidate key and also part of FD. So, it is lossless.
C→ D is following Transitive dependency. So, it never become 3NF.
According to given choices, A is the correct choice.
Correct Answer: A
Question 738 Explanation:
Given, functional dependencies are F={A→ BC, C→ D}
Finding candidate key of given relation is relation is
A+={A,B,C} because we don’t have an A element in right hand side.
A→ BC dependency A is the candidate key and also part of FD. So, it is lossless.
C→ D is following Transitive dependency. So, it never become 3NF.
According to given choices, A is the correct choice.
Finding candidate key of given relation is relation is
A+={A,B,C} because we don’t have an A element in right hand side.
A→ BC dependency A is the candidate key and also part of FD. So, it is lossless.
C→ D is following Transitive dependency. So, it never become 3NF.
According to given choices, A is the correct choice.