545 views
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

3 Answers

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
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.

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)

Related questions

5 votes
5 votes
4 answers
1
learncp asked Dec 17, 2015
5,309 views
Given R(ABCD) andAB → C ;ABD → C ;ABC → D ;AC → Dwhich the highest possible normal form for the above relation ?
2 votes
2 votes
4 answers
2
Dulqar asked Feb 1, 2017
940 views
Consider the relation R(Name,courseNO,rolNO,grade)name,courseno ->graderollno,courseno->gradename->rollnorollno->name Given answer as it is 3NF . But Im getting 1NF. is ...
3 votes
3 votes
3 answers
3
learncp asked Dec 16, 2015
9,992 views
Given a relation R (ABCD), and the following FDs- A->BCDBC->ADD->B.which is the highest normal form the table is in.a) 1NFb) 2NFc)3NFd) BCNF
2 votes
2 votes
2 answers
4