3 votes 3 votes Determine the highest possible normal form of the given relation: A -->BCDEF, BC --> ADEF, B -->F a. 1NF b. 2 NF c. 3NF d. BCNF Databases database-normalization + – sh!va asked Nov 11, 2016 sh!va 545 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes Here the candidate keys are A, BC there is a fd B->F which is a partial dependency as B is partial of key and F is a non prime attribute . . . So it is in 1NF Pavan Kumar Munnam answered Nov 11, 2016 Pavan Kumar Munnam comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Ck::: A,BC.. B->F it is PD so due to existance of partial keys we can surely say that it is in 1NF. Paras Nath answered Dec 12, 2016 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Candidate Key: A, BC B - > F Proper subset of candidate key gives a non prime attribute, so it is a partial dependency. Hence relation is in 1NF (assuming it has atomic values only) smsubham answered Aug 17, 2017 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.