Question

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}R_1(A, B, C, D, E): \{ D \rightarrow E, \; EA \rightarrow B, \; EB \rightarrow C \}
R2(A,B,C,D):{A→D,  A→B,  C→A}R_2(A, B, C, D): \{ A \rightarrow D, \; A \rightarrow B, \; C \rightarrow A \}

Which of the following statement(s) is/are TRUE?

Choose every correct option
Official answer and solution
Official answer
C and D
From
Official GATE 2025 answer key

Solution

Find all candidate keys and prime attributes of R1R_1 and R2R_2, then check whether every non-trivial FD X→YX \rightarrow Y has either XX a superkey or YY prime.

  1. Analysis of R1(A,B,C,D,E)R_1(A, B, C, D, E):
    • Attributes AA and DD never appear on the RHS of any FD, so every candidate key must contain ADAD.
    • Since (AD)+={A,D,E,B,C}(AD)^+ = \{A, D, E, B, C\}, ADAD is the unique candidate key of R1R_1.
    • Prime attributes: {A,D}\{A, D\}; Non-prime attributes: {B,C,E}\{B, C, E\}.
    • In the FD D→ED \rightarrow E, DD is not a superkey and EE is non-prime (similarly for EA→BEA \rightarrow B and EB→CEB \rightarrow C). Thus R1R_1 is NOT in 3NF (C).
  2. Analysis of R2(A,B,C,D)R_2(A, B, C, D):
    • Attribute CC never appears on the RHS of any FD, and C+={C,A,B,D}C^+ = \{C, A, B, D\}, so CC is the unique candidate key of R2R_2.
    • Prime attribute: {C}\{C\}; Non-prime attributes: {A,B,D}\{A, B, D\}.
    • In the FDs A→DA \rightarrow D and A→BA \rightarrow B, AA is not a superkey and B,DB, D are non-prime. Thus R2R_2 is NOT in 3NF (D).
Final answer

Options (C), (D)

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2025 Computer Science and Information Technology - Session 2 (CS2)
Question
46 of 65
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.