retagged by
317 views

1 Answer

Best answer
1 votes
1 votes
we can solve it by verifying options.

Option A) $(CA)^+\rightarrow CABE$

Option B) $(AB)^+\rightarrow AB\rightarrow ABC\rightarrow ABCE$

Option C) $(BD)^+\rightarrow BDE$

Option D) $(AD)^+\rightarrow ABD\rightarrow ABCD\rightarrow ABCDE $

So this option covers all the attributes, unlike others.

Option (D) is correct.
edited by
Answer:

Related questions

370
views
1 answers
0 votes
Bikram asked Feb 9, 2017
370 views
Consider a relation $R$\left ( A, B,C,D, E \right )$ with the following $FD$ set $F$: $A\rightarrow BC$ $CD\rightarrow E$ $B\rightarrow D$ $ ... $A\rightarrow BC$ , $B\rightarrow E$ , $B\rightarrow D$ , $E\rightarrow A$
360
views
1 answers
0 votes
Bikram asked Feb 9, 2017
360 views
Consider the following schedule: $S =$ ${R1(A),R2(B),W2(A),W1(A)}$Assume that Transaction $T1$ has started execution before the Transaction $T2$. ... Write Rule. Not allowed under both Basic Timestamp Protocol and Thomas Write Rule.
928
views
2 answers
10 votes
Bikram asked Feb 9, 2017
928 views
Consider three tables with the following number of tuples in each:$X$\left ( a,b,c \right )$ $= 100$ || $Y$\left ( a,d,e \right )$ $= 80$ ... number of tuples in ( $X$ left outer join $Y$ ) full outer join $Z$ is ________.
589
views
1 answers
1 votes
Bikram asked Feb 9, 2017
589 views
Which of the following statements are TRUE? An SQL query automatically eliminates duplicates. An SQL query will not work if there are no indexes on the relations ... repeated in the same relation.I and III II onlyIII onlyI and II only