Computer Science · Database Keys & Functional Dependencies
Consider relation schema R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies { {A, B} → {C}, {B} → {E, F}, {A, D} → {G, H}, {G} → {I}, {H} → {J} }. Which of the following is a candidate key for R?
- 1{A}
- 2{A, B, D, G, H}
- 3{A, B, D}✓
- 4{A, B}
Correct answer
{A, B, D}
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Keys & Functional Dependencies?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Keys & Functional Dependencies