OA. free
Free
MathWorks Probability & Puzzles Core Computer Science Medium

Which of the following statements is TRUE regarding Super Keys and Candidate Keys in a...

MathWorks technical mcq question, verified with a worked answer. Free to practise - no sign-up.

Which of the following statements is TRUE regarding Super Keys and Candidate Keys in a Relational Database?

Choose one option.
Show answer & explanation
Answer: B. Every candidate key is a minimal super key.

A candidate key is defined as a minimal super key—a super key with no redundant attributes that can still uniquely identify a tuple. While every super key can uniquely identify tuples, not all super keys are minimal (option A is false). A primary key is always chosen from the candidate keys (option C is false). Super keys can contain redundant attributes; that's what makes them non-minimal (option D is false).

Step-by-step Derivation:
Definitions:

  • Super Key: Any set of attributes that can uniquely identify a tuple in a relation (may contain redundant attributes).
  • Candidate Key: A minimal super key—a super key from which no attribute can be removed while still maintaining uniqueness.
  • Primary Key: A candidate key selected by the DBA to serve as the main identifier.

Analysis:
A) FALSE – A super key like {StudentID, Name, Email} is not a candidate key because it contains redundancies. Candidate keys are minimal super keys.
B) TRUE – By definition, a candidate key is a super key with the minimality property: remove any attribute and uniqueness is lost.
C) FALSE – The primary key must be chosen from the candidate keys. It cannot be any arbitrary super key.
D) FALSE – Super keys can have redundant attributes; that's their distinction from candidate keys.

Conclusion: Option B is correct.