Question from the Database - Fundamentals test

Given a set of functional dependencies, find the minimum number of functional dependencies to be removed in order to achieve a non redundant coverage.

Expert

Let {a $\rightarrow$ b; c $\rightarrow$ a, d, e; f $\rightarrow$ a}

What is the minimum number of functional dependencies to be removed in order to achieve a non redundant coverage?

Author: titouan lecampStatus: PublishedQuestion passed 276 times

Edit

Community EvaluationsNo one has reviewed this question yet, be the first!