Skip to content
Official PYQ · 2026

GATE CS 2026 Set 1 Q20 — Normal Forms

Explain with AI

Let P,Q,RP, Q, R and SS be the attributes of a relation in a relational schema. Let X→YX \rightarrow Y indicate functional dependency in the context of a relational database, where X,Y⊆{P,Q,R,S}X, Y \subseteq\{P, Q, R, S\}.

Which of the following options is/are always true?

Select all correct options
View worked solution

Answer: C;D

We can evaluate the correctness of each option using Armstrong's axioms for functional dependencies:

  • Option A: False. If P→RP \rightarrow R holds, then by augmentation, PQ→RPQ \rightarrow R also holds. However, this does not imply Q→RQ \rightarrow R. For example, in the relation instance with tuples (P:1,Q:1,R:5)(P:1, Q:1, R:5) and (P:2,Q:1,R:6)(P:2, Q:1, R:6), we have P→RP \rightarrow R and PQ→RPQ \rightarrow R holding, but Q→RQ \rightarrow R is violated.
  • Option B: False. A composite key PQ→RPQ \rightarrow R does not imply that either of the individual attributes determines RR. For example, if PP is First Name, QQ is Last Name, and RR is Roll Number, PQ→RPQ \rightarrow R can hold without P→RP \rightarrow R or Q→RQ \rightarrow R holding.
  • Option C: True.
    • From P→RP \rightarrow R, by augmenting with QQ, we get PQ→RQPQ \rightarrow RQ.
    • From Q→SQ \rightarrow S, by augmenting with RR, we get RQ→RSRQ \rightarrow RS.
    • By transitivity, PQ→RQPQ \rightarrow RQ and RQ→RSRQ \rightarrow RS imply PQ→RSPQ \rightarrow RS, which is equivalent to {P,Q}→{R,S}\{P, Q\} \rightarrow \{R, S\}.
  • Option D: True. This is the standard augmentation rule. If P→RP \rightarrow R, then adding any attribute QQ to the left-hand side still determines RR, i.e., PQ→RPQ \rightarrow R.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Normal Forms questions