1,886 views

3 Answers

6 votes
6 votes
Miinimal (canonical) cover of a set of FDs is the minimal set of FDs such that all other FDs can be derived.

So, {X -> Y, Y -> Z, Z-> X}, {X->Z, Z-> Y, Y->X}
1 votes
1 votes

minimal cover is known as canonical cover
here two canonical cover are possible
we get canonical cover by eliminating redundant FDs
1st cv :
becoz z->x so we can replace x by z in y->xz ( becoz if child derivates sumthing dan child will surely do dat) nd get y->z (1)
by spliting we cn write x->yz as x->y (2) nd x->z(3)
if we combine (2) nd (1) by union rule we get x->z
which is nothing bt (3) FD so we cn elliminate (1) nd (2) becoz de r redundant
nd we got 1st canonical cover as {x->z}
similarly we got 2nd minimal cover as {y->z}.

see this:https://gateoverflow.in//blog/13/shortest-way-to-find-minimal-cover

1 votes
1 votes
x→y and z→x are minimal cover
edited by

Related questions

1 votes
1 votes
2 answers
1
Saurav asked Oct 1, 2015
2,762 views
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBRWhich one of the following is a possible operation performed by this seq...
2 votes
2 votes
0 answers
2
techbrk3 asked Nov 9, 2017
705 views
Which of the following is correct?Both are functionally complete.Only f is functionally complete.Only g is functionally complete.Neither is functionally complete.
1 votes
1 votes
3 answers
4