Question 61Asked in UGC NET Computer Science, June 2015 (Paper II & III, Selected Questions)

Select the 'False' statement from the following statements about Normal forms :

  1. ALossless preserving decomposition into 3NF is always possible
  2. BLossless preserving decomposition into BCNF is always possible
  3. CAny Relation with two attributes is in BCNF
  4. DBCNF is stronger than 3NF
Show answerHide answer

Correct answer: (C) Any Relation with two attributes is in BCNF

Explanation

Note: statement (c) is actually true (every two-attribute relation is in BCNF); the false statement is (b), so the book's key appears wrong. A BCNF decomposition that is both lossless and dependency preserving is not always possible. Example: R(a, b, c) with FDs ab → c and c → b cannot be decomposed into BCNF while preserving ab → c.

From UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions)

This is question 61 of UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions). 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.