GATE DA 2025 Q57: Candidate keys and BCNF for R(ABCDEFG)
- Database Management and Warehousing
- 2 marks
- MSQ
- No negative marking
Question
Consider a database relation R with attributes ABCDEFG, and having the following functional dependencies:
Which of the following statements is/are correct?
Try it: multiple select: one or more correct options
Select all correct options. No negative marking, no partial marks.
Show answer and explanation
Answer: B, D (official GATE 2025 final answer key)
Concept used: Attribute closure to find candidate keys; BCNF requires every determinant to be a superkey.
First step: Compute closures: = all attributes, and includes A, so it is everything too. Then check .
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2025 DA question paper and final answer key, organised by IIT Roorkee. Question paper · Answer key
More Database Management and Warehousing PYQs
- 2025 · Q16Non-dependency-preserving decomposition: which operator runs more?
- 2025 · Q17Relational algebra on Car, Make and Own
- 2025 · Q33SQL: loans larger than every SR Nagar loan
- 2025 · Q46OLAP: rows returned by GROUP BY CUBE(D1, D2)
- 2025 · Q56Keys and NULLs in Person and Customer tables
- 2025 · Q62Relational division: customers with loans at every branch