The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+14 votes

Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the following is a key for $R$?

  1. CD
  2. EC
  3. AE
  4. AC
asked in Databases by Veteran (59.6k points) | 569 views

1 Answer

+18 votes
Best answer
Answer: B

EC is the key for R. Both E and C are not coming on the right hand side of any functional dependency. So, both of them must be present in any key. Now, with EC and the given FDs, we can derive all other attributes making EC a key.
answered by Boss (34k points)
selected by

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

40,871 questions
47,532 answers
62,298 users