A table has fields Fl, F2, F3, F4, F5 with the following functional dependencies
F1 → F3 F2→ F4 (F1 . F2) → F5
In terms of Normalization, this table is in
(A) 1 NF
(B) 2 NF
(C) 3 NF
(D) none
Answer: (A)
Explanation:
First Normal Form
A relation is in first normal form if every attribute in that relation is singled valued attribute.
Second Normal Form
A relation is in 2NF iff it has No Partial Dependency, i.e., no non-prime attribute (attributes which are not part of any candidate key) is dependent on any proper subset of any candidate key of the table.
This table has Partial Dependency f1->f3, f2-> f4 given (F1,F2) is Key
So answer is A
Quiz of this Question
Please comment below if you find anything wrong in the above post