Question 9670 – GATE 2002
January 6, 2024Database-Management-System
January 6, 2024Database-Management-System
| Question 30 |
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
| 1 NF | |
| 2 NF | |
| 3 NF | |
| None |
Question 30 Explanation:
F1 → F3 ……(i)
F2 → F4 ……(ii)
(F1⋅F2) → F5 …..(iii)
F1F2 is the candidate key.
F1 and F2 are the prime key.
In (i) and (ii) we can observe that the relation from P → NP which is partial dependency. So this is in 1NF.
F2 → F4 ……(ii)
(F1⋅F2) → F5 …..(iii)
F1F2 is the candidate key.
F1 and F2 are the prime key.
In (i) and (ii) we can observe that the relation from P → NP which is partial dependency. So this is in 1NF.
Correct Answer: A
Question 30 Explanation:
F1 → F3 ……(i)
F2 → F4 ……(ii)
(F1⋅F2) → F5 …..(iii)
F1F2 is the candidate key.
F1 and F2 are the prime key.
In (i) and (ii) we can observe that the relation from P → NP which is partial dependency. So this is in 1NF.
F2 → F4 ……(ii)
(F1⋅F2) → F5 …..(iii)
F1F2 is the candidate key.
F1 and F2 are the prime key.
In (i) and (ii) we can observe that the relation from P → NP which is partial dependency. So this is in 1NF.