Question

Consider the relation X(P,Q,R,S,T,U)X(P, Q, R, S, T, U) with the following set of functional dependencies

F={{P,R}→{S,T},  {P,S,U}→{Q,R}}F = \{\{P, R\} \to \{S, T\}, \; \{P, S, U\} \to \{Q, R\}\}

Which of the following is the trivial functional dependency in F+F^+, where F+F^+ is closure of FF?

Choose one option
Official answer and solution
Official answer
C
From
Official GATE 2015 answer key

Solution

Recall the formal definition of a trivial functional dependency.

By definition, a functional dependency A→BA \to B is trivial if and only if the right-hand side is a subset of the left-hand side:

B⊆AB \subseteq A

Evaluate the choices:

  • Option A: {P,R}→{S,T}\{P, R\} \to \{S, T\}. Here {S,T}⊈{P,R}\{S, T\} \not\subseteq \{P, R\}, so it is non-trivial.
  • Option B: {P,R}→{R,T}\{P, R\} \to \{R, T\}. Here {R,T}⊈{P,R}\{R, T\} \not\subseteq \{P, R\} (since T∉{P,R}T \notin \{P, R\}), so it is semi-trivial / non-trivial.
  • Option C: {P,S}→{S}\{P, S\} \to \{S\}. Here {S}⊆{P,S}\{S\} \subseteq \{P, S\}. Thus, {P,S}→{S}\{P, S\} \to \{S\} is a trivial functional dependency.
  • Option D: {P,S,U}→{Q}\{P, S, U\} \to \{Q\}. Here {Q}⊈{P,S,U}\{Q\} \not\subseteq \{P, S, U\}, so it is non-trivial.

Therefore, Option C is the trivial functional dependency.

Final answer

C

Common trap

Confusing functional dependencies given in F with trivial dependencies, which hold universally by reflexivity regardless of F.

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2015 Computer Science and Information Technology (CS) Session 3
Question
30 of 65, printed as CS Q.20
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.