364 views
4 votes
4 votes

From the following instance of a relation schema $R(A,B,C)$, we can conclude that:(Mark all the appropriate options)
$$\begin{array}{|l|l|l|}\hline \textbf{A} & \textbf{B} & \textbf{C} \\
\hline \text{1} & \text{4} & \text{5} \\
\hline \text{5} & \text{6} & \text{4} \\
\hline \text{1} & \text{3} & \text{5} \\
\hline \text{5} & \text{2} & \text{2} \\
\hline \text{2} & \text{4} & \text{3} \\
\hline \end{array}$$

  1. $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$.
  2. $A$ does not functionally determine $C$ and $B$ does not functionally determine $C$.
  3. $C$ does not functionally determine $B$ and $B$ does not functionally determine $A$.
  4. $C$ functionally determines $A$ and $B$ does not functionally determine $C$.

1 Answer

Best answer
4 votes
4 votes
Options A, B and C are correct. D is not correct because from a given instance we cannot conclusively say that a Functional Dependency exists though we may be able to conclusively prove that a functional dependency is violated. This is because there can be other instances where the functional dependency is violated. (This is similar to a counter example proving a statement FALSE but an example does not prove a statement TRUE)

So, the correct answer is $A;B;C$
selected by
Answer:

Related questions

1 votes
1 votes
1 answer
2
gatecse asked Oct 8, 2020
161 views
Given the following relation instance.$$\begin{array}{|l|l|l|}\hline \text{X} & \text{Y} & \text{Z} \\\hline \text{1} & \text{0} & \text{5} \\\text{2} & \text{1} & \text{...
2 votes
2 votes
2 answers
4