Following are the major normalization forms in a DBMS:

Considering the above Table-1 as the reference example for understanding different normalization forms.

• 1NF: It is known as the first normal form and is the simplest type of normalization that you can implement in a database. A table to be in its first normal form should SATISFY the following conditions:
  • Every column must have a single value and should be atomic.
  • Duplicate columns from the same table should be removed.
  • Separate tables should be created for each GROUP of related data and each row should be identified with a unique column.

Table-1 converted to 1NF form

• 2NF: It is known as the second normal form. A table to be in its second normal form should satisfy the following conditions:
  • The table should be in its 1NF i.e. satisfy all the conditions of 1NF.
  • Every non-prime attribute of the table should be fully functionally dependent on the primary key i.e. every non-key attribute should be dependent on the primary key in such a WAY that if any key element is deleted then even the non_key element will be saved in the database.

Breaking Table-1 into 2 different tables to move it to 2NF.

• 3NF: It is known as the third normal form. A table to be in its second normal form should satisfy the following conditions:
  • The table should be in its 2NF i.e. satisfy all the conditions of 2NF.
  • There is no transitive functional dependency of one attribute on any attribute in the same table.

Breaking Table-1 into 3 different tables to move it to 3NF. 

• BCNF: BCNF stands for Boyce-Codd Normal Form and is an advanced form of 3NF. It is also referred to as 3.5NF for the same reason. A table to be in its BCNF normal form should satisfy the following conditions:
  • The table should be in its 3NF i.e. satisfy all the conditions of 3NF.
  • For every functional dependency of any attribute A on B
    (A->B), A should be the SUPER key of the table. It simply implies that A can’t be a non-prime attribute if B is a prime attribute.