Question

write a algorithm to finding a
minimal cover F for a set of
functional dependencies E
​

Answer 1

Answer:

A minimal cover of a set of FDs F is a minimal set of functional dependencies Fmin that is equivalent to F. There can be many such minimal covers for a set of functional dependencies F. Definition 2: A set of FDs F is minimum if F has as few FDs as any equivalent set of FDs.

Explanation:

J. SSR☺️❤☺️☺️☺️☺️☺️