1,242 views
1 votes
1 votes
A table has fields F1, F2, F3, F4, F5 with the following functional dependencies $F1 \rightarrow $F1 \rightarrow F3, F2 \rightarrow F4, (F1,F2) \rightarrow F5$F3$  in terms of normalization this table is in

A) 1NF
B) 3NF

C) 2 NF
D) None of these

2 Answers

4 votes
4 votes
Candidate key for this would be F1F2.. since F1F2 uniquely identifies each attribute.. so table is in 1NF.

Now talking about 2NF, then F1->F3 creates partial dependency because F3 is neither prime attribute nor identified by F2.

So 2NF does not satisfy

hence A.1NF
0 votes
0 votes

The exact question text is below

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

Related questions

0 votes
0 votes
1 answer
1
2 votes
2 votes
1 answer
3
Sankaranarayanan P.N asked Oct 27, 2016
703 views
A B-tree used as an index for a large database table has four levels including root node. If a new key is inserted in this index, then the maximum number of nodes that co...