5,129 views
6 6 votes
Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B}

which of the following is false ?

1.C->A is a partial Dependency

2.C->A is a transitive Dependency

3.D->B IS A Partial dependency

4. All of these

4 Answers

Best answer
5 5 votes
A,B,C,D all are prime attribute so no partial as well as no transitive dependencies..
• selected by
1 1 vote
Here AB , BC , CD , AD are candidate keys.

So , A , B , C , D all are part of prime attributes.

So , the relation is in 3NF .

 

So , ans is (d) : all are false
• edited by
0 0 votes
Candidate keys={AB,AD,BC,CD}

Prime attributes are A,B,C,D

1.C->A (P->P) Not PD(P->NP)

2.C->A(P->P) Not TD(NP->NP)

3.D->B(P>P) Not PD

All are false hence
0 0 votes
CK-AB,C,D so

1-C->A No partial dependency

2-No NPA so no transitive dependency

3-this is also wrong

4-All are false

So option 4 is right option
Position:
Show:

Related questions

0 0 votes
2 2 answers
334
334 views
Syntax-error asked Dec 5, 2025
334 views
2nf decomposition remove all partial dependencies.3Nf decomposition remove all transitive dependencies. are these statements correct?
1 1 vote
1 1 answer
685
685 views
Akash_Banik asked Oct 28, 2024
685 views
why is prime->prime dependency doesn't violates 2nf . say table(a,b,c,d,e) and {(a,b),(d,e)} are candidates key and there is a relation from a->d. does it follow function...
1 1 vote
1 1 answer
659
659 views
Milli asked Oct 21, 2024
659 views
For R(ABCDE), given candidate keys are ABC, ACD.Now if given FD is ABD->E then what is the highest normal form?ABD is not a super key/ candidate key or E is prime so it's...