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

Question from the Database - Fundamentals test

Find the minimum number of functional dependencies to be removed in order to achieve a non redundant coverage.

Medium

let the following Relation be: {a →\rightarrow b, c, d, e; b →\rightarrow c}

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

Author: titouan lecampStatus: PublishedQuestion passed 97 times
Edit
0
Community EvaluationsNo one has reviewed this question yet, be the first!
Similar Questions
More questions about Database
5
How to obtain the surname and first name of people running more than 10 units?
4
What is GDPR?
3
The decomposition normalization algorithm is?.
3
What type of constraint was violated?
2
Find the keys of the following functional dependencies: a, b -> c a, b, d -> e c -> a, b d -> f e -> g