Which normal form is stricter than 3NF and is often described as a configuration where every determinant must be a candidate key? MCQ with Answer and Explanation
Which normal form is stricter than 3NF and is often described as a configuration where every determinant must be a candidate key?
A. Boyce-Codd Normal Form (BCNF)
B. 5NF
C. 2NF
D. 4NF
Answer: Option A
Solution (By JKSSB Mock Tests)
Boyce-Codd Normal Form (BCNF) is a stronger version of 3NF. A relation is in BCNF if, for every non-trivial functional dependency X -> Y, X is a candidate key.
No comments yet. Be the first to start the discussion!