Question
Consider a relational schema , with functional dependencies .
The relation is decomposed into two relations, and . Which of the following statement(s) is/are TRUE?
Official answer and solution
- Official answer
- B and C
- From
- Official GATE 2025 answer key
Solution
Find the candidate key of team, t1, and t2, and check the BCNF and lossless-join conditions.
- In , the closure of is , so is the sole candidate key. Since both FDs and have a superkey on the left-hand side, is already in BCNF (and hence in 3NF). Thus (A) and (D) are false.
- In with and with , is a superkey in both relations, so both and are in BCNF ((B) is TRUE).
- The common attribute is , which is a key for both and , so the decomposition is a lossless join ((C) is TRUE).
Final answer
Options (B), (C)
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 1 (CS1)
- Question
- 47 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.