DBMS- Normalization Questions and Answers

Take Exam

Normalization in DBMS is a process used to organize data efficiently and remove redundancy. This topic is a key part of DBMS interview questions and answers and frequently appears in placement exams by TCS, Accenture, Infosys, and Wipro. In this article on DBMS Normalization questions with answers, you’ll learn about different normal forms (1NF, 2NF, 3NF, BCNF) and how they improve database design. Questions typically test your understanding of functional dependencies, decomposition, and anomaly prevention. Practicing Database programming MCQs with clear explanations helps you strengthen both theoretical and practical knowledge needed for interviews and university exams. Use this section as a quick revision tool and practice resource before your next placement or test.

DBMS- Normalization

Showing 10 of 26 questions

1. Normalization is a process of decomposing a set of relations with anomalies to produce smaller and well-structured relations that contains minimum or no redundancy.

  • TRUE
  • FALSE
Show Answer Report

2. A relation is said to be in 1NF if the values in the domain of each attribute of the relation are non-atomic.

  • TRUE
  • FALSE
Show Answer Report

3. 1NF contains no redundant information.

  • TRUE
  • FALSE
Show Answer Report

4. 2Nf is  always in 1NF.

  • TRUE
  • FALSE
Show Answer Report

5. When a relation R in 2NF with FDs A--->B and B--->CDEF (where A is the only candidate key), is deconposed into two relations R1 (with A-->B) and R2 (with B-->CDEF), the relations R1 and R2 (a)   are always a lossless decomposition of R. (b) usually have total combined storage space less than R. (c) have no delete anomalies. (d) will always be faster to execute a query than R.

  • TRUE
  • FALSE
Show Answer Report

6. 2NF is the removal of the partial functional dependencies or redundant data.

  • TRUE
  • FALSE
Show Answer Report

7. When a relation R in 3NF with FDs AB ----->C and C--->B is decomposed into two relations R1 (with AB---->null, that is, all key) and R2 (with C---->B), the relations R1 and R2 (a) are always dependency preserving. (b) usually have total combined storage space less than R. (c) have no delete anomalies.

  • TRUE
  • FALSE
Show Answer Report

8. In 3NF, no non-prime attribute is functionally dependent on another no-prime attribute.

  • TRUE
  • FALSE
Show Answer Report

9. In  BCNF,  a relation must only have candidate keys as determinants.

  • TRUE
  • FALSE
Show Answer Report

10. Lossless-join dependency is a property of decomposition, which ensures that no spurious tuples are generated when relations are returned through a natural join operation.

  • TRUE
  • FALSE
Show Answer Report
Questions and Answers for Competitive Exams Various Entrance Test