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. 2NF
B. Boyce-Codd Normal Form (BCNF)
C. 5NF
D. 4NF
Answer: Option B
Solution (By JKExamLibrary)
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.
Explanation:
A Common Table Expression (CTE) provides a temporary named result set that can be used within a SELECT, INSERT, UPDATE, or DELETE statement.
Explanation:
The Object-Oriented Data Model integrates object-oriented programming languages directly with databases, storing data as objects with attributes and methods.
No comments yet. Be the first to start the discussion!