retagged by
3,452 views
7 votes
7 votes

Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ .

retagged by

7 Answers

14 votes
14 votes
here every key is a primary key..
numbber of minimal covers = 5 i think
1)A-->B, B-->C, C-->A
2)A-->C, C-->B, B-->A
3)B-->AC, A-->B ,C-->B
4)A-->BC , B-->A, C-->A
5)C-->AB ,A-->C, B-->C
did i miss any?
3 votes
3 votes

The minimal cover is A->C,B->C,C->A,C->B

Another two are A->B,B->C.C->A and A->C,B->A,C->B .

Thus total different minimal covers are 3.

edited by
0 votes
0 votes
A--->B, A--->C, B-->A, C-->A

A--->B, B--->A, B-->C, C-->B

A--->B, B--->C, C-->B, C-->A

A-->B, B-->C, C-->A

 A--->C, B-->C, C-->A

total 5

Related questions

0 votes
0 votes
1 answer
1
Shamim Ahmed asked Dec 20, 2018
573 views
I came across the questions where questions are asked about finding minimal cover and number of different minimal cover possible. Are they same?https://gateoverflow.in/28...
1 votes
1 votes
4 answers
2
Himanshu1 asked Jan 2, 2016
3,054 views
2 votes
2 votes
2 answers
3
gauravalgo asked Jun 19, 2015
1,211 views
Consider the attribute set R = ABCDEGH (where Functional Dependencies areF= {AB· C,AC B: AD - E, B - D, BE A, B - G}.
4 votes
4 votes
1 answer
4