Question
Consider the following relational schema along with all the functional dependencies that hold on them.
Which of the following statement(s) is/are TRUE?
Official answer and solution
- Official answer
- C and D
- From
- Official GATE 2025 answer key
Solution
Find all candidate keys and prime attributes of and , then check whether every non-trivial FD has either a superkey or prime.
- Analysis of :
- Attributes and never appear on the RHS of any FD, so every candidate key must contain .
- Since , is the unique candidate key of .
- Prime attributes: ; Non-prime attributes: .
- In the FD , is not a superkey and is non-prime (similarly for and ). Thus is NOT in 3NF (C).
- Analysis of :
- Attribute never appears on the RHS of any FD, and , so is the unique candidate key of .
- Prime attribute: ; Non-prime attributes: .
- In the FDs and , is not a superkey and are non-prime. Thus 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.