(R1 ∩ R2) → (R1 − R2) or (R1 ∩ R2) → (R2 − R1) is in F⁺
Dependency preservation test
Z = X; Z = Z ∪ (closure(Z ∩ Ri) ∩ Ri) until stable; Y ⊆ Z
Guarantees
BCNF: lossless, maybe not DP. 3NF synthesis: lossless and DP
Hierarchy
BCNF ⊂ 3NF ⊂ 2NF ⊂ 1NF
What GATE asks from this
Question types seen repeatedly in past papers. More stars means more frequent.
★★★
Highest normal form of R with FDs
Keys → prime attributes → test each FD.
★★★
Is the decomposition lossless / dependency preserving?
Chase for several parts; binary test for two; DP closure test.
★★★
Number of relations / what a BCNF or 3NF decomposition looks like
Run the algorithm; compare candidate answers.
★★★
True/false statements about normal forms
Hierarchy, guarantees of each algorithm, binary relations are in BCNF.
Ratings are approximate, based on recurring patterns in past GATE CSE papers.
Previous year questions
11 real questions from the official GATE CSE papers (2012 to 2025), 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.
11 questions · 0 correct of 0 attempted · marks 0 / 19
Year:
GATE 2025 CS2 · Q46MSQ2 marks
Consider the following relational schema along with all the functional dependencies that hold on them. R1(A, B, C, D, E): { D → E, EA → B, EB → C }. R2(A, B, C, D): { A → D, A → B, C → A }. Which of the following statement(s) is/are TRUE?
One or more options may be correct. Select all that apply, then submit.
GATE 2025 CS1 · Q47MSQ2 marks
Consider a relational schema team(name, city, owner), with functional dependencies {name → city, name → owner}. The relation team is decomposed into two relations, t1(name, city) and t2(name, owner). Which of the following statement(s) is/are TRUE?
One or more options may be correct. Select all that apply, then submit.
GATE 2022 · Q14MCQ1 mark
In a relational data model, which one of the following statements is TRUE?
GATE 2021 Set 1 · Q33MCQ2 marks
Consider the relation R(P, Q, S, T, X, Y, Z, W) with the functional dependencies PQ → X; P → YX; Q → Y; Y → ZW. Consider the decomposition of R into the following two schemes. D1: R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]. D2: R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]. Which one of the following options is correct?
GATE 2020 · Q36MCQ2 marks
Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?
GATE 2019 Set 2 · Q32MCQ2 marks
Let the set of functional dependencies F = {QR → S, R → P, S → Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS). Consider the two statements: I. Both Y and Z are in BCNF. II. Decomposition of X into Y and Z is dependency preserving and lossless. Which of the above statements is/are correct?
GATE 2018 · Q42MCQ2 marks
Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed. Schema I: Registration(rollno, courses), where courses is a set-valued attribute; rollno → courses. Schema II: Registration(rollno, courseid, email); {rollno, courseid} → email; email → rollno. Schema III: Registration(rollno, courseid, marks, grade); {rollno, courseid} → {marks, grade}; marks → grade. Schema IV: Registration(rollno, courseid, credit); {rollno, courseid} → credit; courseid → credit. Which one of the relational schemas above is in 3NF but not in BCNF?
GATE 2016 Set 1 · Q23MCQ1 mark
A database of research articles in a journal uses the schema (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE). The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist: (VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE; (VOLUME, NUMBER) → YEAR; (VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE. The database is redesigned to use the schemas (VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE) and (VOLUME, NUMBER, YEAR). Which is the weakest normal form that the new database satisfies, but the old one does not?
GATE 2014 Set 1 · Q30MCQ2 marks
Given the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. S2: AB → C, D → E, E → C is a minimal cover for the set of functional dependencies AB → C, D → E, AB → E, E → C. Which one of the following is CORRECT?
GATE 2013 Code A · Q55MCQ2 marks
Relation R has eight attributes ABCDEFGH, with the functional dependencies F = {CH → G, A → BC, B → CFH, E → A, F → EG} (linked with the previous question; the candidate keys are AD, BD, ED and FD). The relation R is
GATE 2012 Code A · Q2MCQ1 mark
Which of the following is TRUE?
Common traps
Prime means part of some candidate key, not the primary key only.
A decomposition can be dependency preserving but lossy, or lossless but not dependency preserving.
The 3NF test is "key or prime"; BCNF has no prime escape.
To test a decomposition, the FDs must be considered in the closure, not only the listed ones.