Job offersCompaniesTestsBlogI'm an employerSign upLog in
Home>IT Tests>Questions>Given a set of functional dependencies, find the minimum number of functional dependencies to be removed in order to achieve a non redundant coverage.

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→\rightarrowa}

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

Author: W3D TeamStatus: PublishedQuestion passed 417 times
Edit
0
Community EvaluationsNo one has reviewed this question yet, be the first!
Similar Questions
4
What type of constraint was violated?
4
Find the keys of the following functional dependencies: a, b -> c a, b, d -> e c -> a, b d -> f e -> g
8
How to obtain the surname and first name of people running more than 10 units?
2
What happens when you make the same transaction several times?
5
Which entity provides the legal framework supervising databases in France?
4
What is GDPR?
3
The decomposition normalization algorithm is?.