1,332 views
4 votes
4 votes
If A Relation R(A,B,C,D)  and CK given is (AB,C)

and FD is given as A->C

 

Then the relation is in which highest normal form?

4 Answers

2 votes
2 votes
2NF because there is no FD for which the nonprime attribute is not fully functionally dependent on the primary key.

3NF because there is no FD for which a nonprime attribute is transitively dependent on primary key.

 

NOT 4NF because for every non-trivial FD LHS must be a super key which is not in this case
2 votes
2 votes
3 nf.....

as candidate keys are ab and c so

all the functional dependency would be like candidate key to non prime attributes or prime attributes to prime attributes.
1 votes
1 votes
If the candidate keys are
AB, C
then the dependencies would be

AB->CD
C->ABD
And
A->C      (Given)
 

Now here every non prime attribute(D) is non transitively dependent on EVERY  Key attribute of R i.e. (AB , C)

Therefore it is in 3NF
0 votes
0 votes
1NF because no transitive partial dependency and Not 2NF
edited by

Related questions

2 votes
2 votes
2 answers
1
Parshu gate asked Sep 17, 2017
1,108 views
0 votes
0 votes
3 answers
2
5 votes
5 votes
3 answers
3
GateAspirant999 asked Oct 29, 2016
2,347 views
A relation R(A,B,C,D,E,F) holds following FDs$AB\rightarrow C$$C\rightarrow D$$D\rightarrow EA$$E\rightarrow F$$F\rightarrow B$The number of minimal candidate keys of R a...
0 votes
0 votes
1 answer
4
srestha asked Jan 18, 2017
2,422 views
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E}Number of candidate key in the following relatio...