Computer Sciences > Gate 2015 Set-3 > Functional Dependency
Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies
F = {
{P, R} → {S,T},
{P, S, U} → {Q, R}
}
Which of the following is the trivial functional dependency in F+ is closure of F?
F = {
{P, R} → {S,T},
{P, S, U} → {Q, R}
}
Which of the following is the trivial functional dependency in F+ is closure of F?
Correct : Functional Dependency
Similar Questions
The following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}:
V→W
VW→X
Y→VX
Y→Z
Which of the following is ir...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Total Unique Visitors
Loading......