Why it matters: The engine of normalisation. Closure, candidate keys and canonical cover appear almost every year and are quick marks once the method is automatic.
a super key none of whose proper subsets is a super key
Union rule
X → Y and X → Z ⟹ X → YZ
Decomposition rule
X → YZ ⟹ X → Y and X → Z
Pseudo-transitivity
X → Y and WY → Z ⟹ WX → Z
Equivalence
F ≡ G iff F covers G and G covers F
What GATE asks from this
Question types seen repeatedly in past papers. More stars means more frequent.
★★★
Find candidate keys / number of keys
Closure method; check every minimal set, not just the first.
★★★
Is this FD implied by F?
Compute X⁺ under F.
★★★
Minimal cover / number of FDs in it
Split, drop extraneous attributes, drop redundant FDs.
★★★
Equivalent FD sets
Cross-check both directions with closures.
Ratings are approximate, based on recurring patterns in past GATE CSE papers.
Previous year questions
6 real questions from the official GATE CSE papers (2013 to 2024), newest first, each with the official answer key and a worked solution. Questions are the property of the GATE organising institutes; this copy is for your personal study.
6 questions · 0 correct of 0 attempted · marks 0 / 9
Year:
GATE 2024 CS1 · Q44MSQ2 marks
The symbol → indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?
One or more options may be correct. Select all that apply, then submit.
GATE 2024 CS2 · Q56NAT2 marks
A functional dependency F: X → Y is termed a useful functional dependency if and only if it satisfies all of: X is not the empty set, Y is not the empty set, and the intersection of X and Y is the empty set. For a relation R with 4 attributes, the total number of possible useful functional dependencies is ______.
GATE 2022 · Q31NAT1 mark
Consider a relation R(A, B, C, D, E) with the following three functional dependencies:
AB → C
BC → D
C → E
The number of super keys in the relation R is ______.
GATE 2017 Set 1 · Q16MCQ1 mark
The following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}:
V → W
VW → X
Y → VX
Y → Z
Which of the following is an irreducible equivalent for this set of functional dependencies?
GATE 2014 Set 1 · Q21MCQ1 mark
Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E, F} → {G}, {F} → {I, J}, {E, H} → {K, L}, {K} → {M}, {L} → {N}} on R. What is the key for R?
GATE 2013 Code A · Q54MCQ2 marks
Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F⁺ is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
Common traps
X → Y does not mean Y → X.
Several candidate keys may exist; the prime attributes are all attributes in any of them.
A minimal cover is not unique; compare two covers by equivalence, not by equality.
Dropping an attribute from a left side is allowed only if the remaining attributes still imply the right side.