GATE CS 2019 (Forenoon) — Question 42

Database Management Systems (DBMS)Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries)MCQ2 marks · −2/3 if wrongMedium

Let the set of functional dependencies \( F = \{QR \rightarrow S, R \rightarrow P, S \rightarrow Q\} \) hold on a relation schema \( X = (PQRS) \). \( X \) is not in BCNF. Suppose \( X \) is decomposed into two schemas \( Y \) and \( Z \) where \( Y = (PR) \) and \( Z = (QRS) \). Consider the two statements given below: I. Both \( Y \) and \( Z \) are in BCNF II. Decomposition of \( X \) into \( Y \) and \( Z \) is dependency preserving and lossless Which of the above statements is/are correct?
  1. A
    Both I and II
  2. B
    I only
  3. C
    II only
  4. D
    Neither I nor II
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group