669 views
0 0 votes

My answer is 11 but in book given answer is 10.if i am wrong please give proper explanation.

as i am getting

2^3+2^2-2^0=11

1 Answer

Best answer
2 2 votes
Didn't use any formula, instead went by the naive method.

Superkeys for A : A, AB, AC, AD, ABC, ABD, ACD, ABCD. So n(A) = 8

Superkeys for BC : BC, BCD, ABC, ABCD. So n(BC) = 4

Here, n(A $\cap$ BC) = 2 as ABC and ABCD are common superkeys

So taking union, we get

n(A $\cup$ BC) = 8 + 4 - 2 = 10
selected by
Position:
Show:

Related questions

1 1 vote
1 1 answer
91
91 views
GO Classes asked Sep 8
91 views
Consider the relation schema $R(A,B,C,D,E,F)$ with$F=\{BE \to C,\ B \to F,\ D \to F,\ AEF \to B,\ A \to E\}$Which of the following is a candidate key of $R$?$ACD$ $AD$ $F...
6 6 votes
1 1 answer
4.9k
4.9k views
set2018 asked Nov 12, 2017
4,903 views
consider the following relational schema R(ABCDE) .The number of super keys in relation R if every two attributes of relation R is candidate keys are ___________
2 2 votes
1 1 answer
792
792 views
1 1 vote
1 1 answer
989
989 views
Sagar Pawar asked May 10, 2015
989 views
If S is a superkey such that S $\cap$ UID is NULL then S $\cup$ UID is also a superkey