The questions can come in any order, so make sure you are selecting right option for all questions.
1. Consider a table with the attributes A, B, C, and D, where {A, B} is a candidate key. If there is a functional dependency A → B and B → C, does the table violate BCNF?
(a) Yes
2. Explain the Boyce-Codd Normal Form (BCNF) and how it differs from the Third Normal Form (3NF)
(b) BCNF eliminates transitive dependencies and is a more restrictive form of normalization than 3NF
3. Consider a table with the attributes A, B, C, and D, where {A, B} is a candidate key. If there is a functional dependency A → B and C → D, does the table violate BCNF?
(b) No
4. How does BCNF address the issue of functional dependencies on a part of a candidate key?
(b) By prohibiting functional dependencies on a proper subset of a candidate key
5. Consider a table with the attributes A, B, C, and D, where {A, B} is a candidate key. If there is a functional dependency A → C, does the table violate BCNF?
(a) Yes
6. In the context of BCNF, what is a candidate key?
(b) A minimal superkey for which no proper subset is a superkey
7. What is the role of closure of attributes in the context of BCNF?
(a) To identify candidate keys
8. In BCNF, what is the significance of a non-trivial functional dependency?
(b) It is a dependency where the determining set is not a superkey.
9. What is the primary goal of achieving Boyce-Codd Normal Form (BCNF) in a relational database?
(b) To eliminate all types of dependencies and achieve the highest level of normalization
