Computer Sciences > GATE 2026 SET-1 > Keys and Normalization
A relation R(ABCD) has only two candidate keys AB and AC. What is the number of super keys?

Correct : 6

A super key is any superset of a candidate key.
Candidate keys are: AB and AC
Remaining attributes (not in both candidate keys) = D
Super keys from candidate key AB:
AB can be extended with any subset of {D}
AB, ABD → 2 super keys
Super keys from candidate key AC:
AC can be extended with any subset of {D}
AC, ACD → 2 super keys
Super keys from candidate key ABC (AB + C):
ABC, ABCD → 2 super keys
Total super keys = AB, ABD, AC, ACD, ABC, ABCD = 6
Note: ABCD is counted only once even though it is a superset of both AB and AC.
∴ The number of super keys = 6

Similar Questions

A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ
Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64
#4 MCQ
Choose the word that is opposite in meaning to the word “coherent”.
#5 MCQ

Related Topics

GATE 2026 Computer Science CSE Set 1 Question 7 DBMS Database Management Systems Super Keys Candidate Keys Keys and Normalization Relational Schema Functional Dependencies Relation R(ABCD) NAT Numerical Answer Type 1 Mark Previous Year Questions

Unique Visitor Count

Total Unique Visitors

Loading......