Number of Different Minimal Cover

Question

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

Comments

What is the proper method to find the minimal cover

---

{A->C, B->C, C->AB}

Answer 1

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?

Comments

Insufficient answer without any detailed approach.

---

@srestha

Maam. the answer should be 4 right ?

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

---

no

selected ans is correct

Answer 2

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.

Comments

We have the find out the number of different minimal cover possible

---

Is it 3?

Other two are

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

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

---

Can someone suggest the proper method to find all minimal covers

---

@Arjun

@srestha

@Mk Utkarsh

Is this the correct answer?

Answer 3

4 IS THE CORRECT ANS

Answer 4

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

Comments

How did you find?

---

I don't have any proper method

I just some intution in selecting the set and then see if it is minimal or not