edited by
2,756 views
2 votes
2 votes

Consider the following relation R(A, B, C, D, E, F, G) and set of functional dependencies.

F={BCD → A, BC → E, A → F, F → G, A→G, C → D}

Which of the following is minimal cover of F?

  1. {BC → A, BC → E, A → F, C → D, A → G}
  2. {BC → A, B → E, A → F, F → G, C → D}
  3. {BC → A, BC → E, A → F, F → G, C → D}
  4. {BC → A, BC → E, A → F, C → D}
edited by

3 Answers

1 votes
1 votes

Given that $R(A,B,C,D,E,F,G)$ and

set of Functional dependencies$:F = \left\{BCD → A, BC→ E, A→ F, F→ G, C→ D, A→ G\right\}$


 

0 votes
0 votes

first delete  D AND find  the closure of remaining, ie- (BC+) =  if you cand the D again then writing BCD WILL BE MORE COSLTY SO, SIMPLY WRITE IT LIKE- BC----->A


0 votes
0 votes
answer can't be B, it doesn't covers F

as in (B) it is given  B$\rightarrow$ E, but to derive E we need both B and C

$\therefore$ BC $\rightarrow$ E

Related questions

4 votes
4 votes
1 answer
1
naveen bhatt asked Dec 7, 2018
1,431 views
Consider the relation R(A,B,C,D,E) with the functional dependencies :A → B, B → C, C → A, D → E, and E → DThe Maximum possible super-keys of R is ______________...
2 votes
2 votes
3 answers
2
6 votes
6 votes
2 answers
3
2 votes
2 votes
0 answers
4