Boyce-Codd Normal Form (BCNF) in DBMS Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is Boyce-Codd Normal Form (BCNF)?

BCNF is a type of database normalization that ensures every determinant is a candidate key. It removes redundancy caused by functional dependencies.

beginner

What is a determinant in the context of BCNF?

A determinant is an attribute or a set of attributes on which some other attribute is functionally dependent.

intermediate

How does BCNF differ from Third Normal Form (3NF)?

BCNF is stricter than 3NF. In BCNF, every determinant must be a candidate key, while 3NF allows some exceptions if the dependent attribute is a prime attribute.

beginner

Why is BCNF important in database design?

BCNF helps eliminate redundancy and update anomalies by ensuring that all functional dependencies are based on candidate keys.

intermediate

Give an example of a functional dependency that violates BCNF.

If in a table, attribute A determines B but A is not a candidate key, then this violates BCNF. For example, if {StudentID, Course} is the key but Course determines Instructor, then Course → Instructor violates BCNF.

Which of the following must be true for a relation to be in BCNF?

A No transitive dependencies exist

B Every attribute is dependent on the primary key

C Every determinant is a candidate key

D Every attribute is atomic

BCNF requires that every determinant in a functional dependency is a candidate key.

BCNF is a stricter form of which normal form?

A First Normal Form (1NF)

B Third Normal Form (3NF)

C Fourth Normal Form (4NF)

D Second Normal Form (2NF)

BCNF is a stricter version of 3NF, removing some exceptions allowed in 3NF.

If a functional dependency exists where the determinant is not a candidate key, what does this imply?

A The relation violates BCNF

B The relation is in 1NF

C The relation is in BCNF

D The relation is in 2NF

BCNF requires determinants to be candidate keys; otherwise, it is violated.

Which problem does BCNF help to avoid in databases?

A Data redundancy and update anomalies

B Slow query performance

C Lack of indexing

D Data encryption issues

BCNF reduces redundancy and prevents update anomalies by enforcing strict dependency rules.

In BCNF, what is a candidate key?

A An attribute that is always numeric

B An attribute that can be null

C An attribute that depends on another attribute

D An attribute that uniquely identifies a tuple

A candidate key uniquely identifies each record in a table.

Explain the main rule that a relation must follow to be in Boyce-Codd Normal Form (BCNF).

Think about what attributes determine others and their role as keys.

Describe why BCNF is considered stricter than Third Normal Form (3NF) and give an example of a violation.

Focus on the role of determinants and candidate keys.