514 views
2 votes
2 votes
Que- R(ABCD) and fds are { A->B ,B->C,C->A} then number of candidate key is........?

Explain please

1 Answer

Best answer
1 votes
1 votes
Closure of A ,B and C give = ABC but D is missing so Candidate key will be AD ,BD,CD now we take closure of AD = ABCD , BD = ABCD , CD = ABCDso we get all attributes of Relation so AD is candidate key
edited by

Related questions

0 votes
0 votes
2 answers
1
4 votes
4 votes
4 answers
3
Tuhin Dutta asked May 27, 2019
2,447 views
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF