Database-Management-System
August 29, 2024Transactions
August 29, 2024Database-Management-System
| Question 414 |
Which of the following relation schema is always in BCNF?
| R( A,B,C,D) | |
| R( A,B,C) | |
| R( A,B,C,D,E) | |
| R( A,B) |
Question 414 Explanation:
BCNF Properties:
1. BCNF is the advance version of 3NF. It is stricter than 3NF.
2. A table is in BCNF if every functional dependency X → Y, X is the super key of the table.
3. For BCNF, the table should be in 3NF, and for every FD, LHS is super key.
4. Two (or) Binary tuples are always be in BCNF
1. BCNF is the advance version of 3NF. It is stricter than 3NF.
2. A table is in BCNF if every functional dependency X → Y, X is the super key of the table.
3. For BCNF, the table should be in 3NF, and for every FD, LHS is super key.
4. Two (or) Binary tuples are always be in BCNF
Correct Answer: D
Question 414 Explanation:
BCNF Properties:
1. BCNF is the advance version of 3NF. It is stricter than 3NF.
2. A table is in BCNF if every functional dependency X → Y, X is the super key of the table.
3. For BCNF, the table should be in 3NF, and for every FD, LHS is super key.
4. Two (or) Binary tuples are always be in BCNF
1. BCNF is the advance version of 3NF. It is stricter than 3NF.
2. A table is in BCNF if every functional dependency X → Y, X is the super key of the table.
3. For BCNF, the table should be in 3NF, and for every FD, LHS is super key.
4. Two (or) Binary tuples are always be in BCNF
Subscribe
Login
0 Comments