edited by
600 views

1 Answer

5 votes
5 votes

There is a slight misprint in the solution otherwise option D is correct

For a superkey you need to make sure that it contains one of the candidate key :
2m ways are there to pick up one of the m keys but it also includes the choice when none of them is choosen so we need to subtract that case (2m-1)

 Rest of prime attributes may or may not be picked, So 2n-m ways.

By rule of counting:

Total ways : (2m-1).(2n-m )

edited by

Related questions

1 votes
1 votes
0 answers
2
anupamsworld asked Jul 29, 2022
527 views
Find the candidate key(s) of the relation R(UVWXYZ) with FD set F={UV >W, XW >Y, U >XZ, Y >U}XWUV, YV, WXVYUV, XV, WVNone of these
0 votes
0 votes
3 answers
3
5 votes
5 votes
3 answers
4
GateAspirant999 asked Oct 29, 2016
2,342 views
A relation R(A,B,C,D,E,F) holds following FDs$AB\rightarrow C$$C\rightarrow D$$D\rightarrow EA$$E\rightarrow F$$F\rightarrow B$The number of minimal candidate keys of R a...