Solution

The correct answer is In 1NF, but not in 2NF.

CONCEPT:

A set of attributes that uniquely identify tuples in a table is called the Candidate key.

Candidate keys may have multiple attributes.

A functional dependency is a relationship or dependency that exists between two attributes.

Closure means the complete set of all possible attributes that can be functionally derived from the functional dependencies.

Normalization is used to minimize redundancy from a set of relations.

It is used to organize data effectively in the database.

Normal forms are used to reduce redundancy from the database.

Normal form	Description
1NF	If a relation contains atomic values then it is in 1NF.
2NF	If a relation is in 1NF and all non-key attributes are fully functionally dependent on the primary key. [No partial dependency must be there]
3NF	A relation is in 2NF and there must not exist any transition dependency.

 

EXPLANATION

According to the given dependencies,

CH → G

A → BC

B → CFH

E → A

F → EG

Since D is not part of any functional dependency so it can be a candidate key or maybe part of a candidate key.

To find more candidate keys add A, B, C, D, E, G, and H to D & find its closure:

(AD)+ = {ABCDEFGH}

(BD)+ = {ABCDEFGH}

(CD)+ = {CD}

(ED)+ = {ABCDEFGH}

(FD)+ = {ABCDEFGH}

(GD)+ = {GD}

(HD)+ = {HD}

Since AD, BD, ED & FD gives all attributes, so they are candidate keys.

But the dependencies,

A → BC, B → CFH, and F → EG are partial dependencies.

{Here C, G, H are non-key attributes.}

Hence, the given relation is in 1NF but not in 2NF.