UTpaper

Free mock tests & test series

Question 154Asked in DSSSB TGT Computer Science, 24 Jun 2023, Shift 3 (4:30 PM)

Consider the relation R (PQRSTU) with the set of functional dependencies F = {P → RT, Q → S, R → PS, QS → TU}. Find the closures of PQ.

  1. APQRST
  2. BPQRTU
  3. CPQRSU
  4. DPQRSTU
Show answerHide answer

Correct answer: (D) PQRSTU

Explanation

PQ⁺: P → RT adds R and T, and Q → S adds S. QS → TU then adds U, so PQ⁺ = PQRSTU (PQ is a key).

From DSSSB TGT Computer Science PYQ, 24 Jun 2023, Shift 3 (4:30 PM)

This is question 154 of DSSSB TGT Computer Science PYQ, 24 Jun 2023, Shift 3 (4:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.