Register

Random college question paper

486 views

1 Answer

0 votes
0 votes

I think the question is incorrect… as there are only few FD’s given.

Assuming 1NF as there is single partialFunctional Dependency. 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
2
Bikram asked Aug 26, 2017
376 views
Test by Bikram | Databases | Test 2 | Question: 7
What is the highest normal form of the relation $R(ABCDEF)$ having functional dependency set at $F = \{ A \rightarrow BC, \ \ C \rightarrow AD, \ \ E \rightarrow ABC, \ \ F \rightarrow CD, \ \ CD \rightarrow BEF, \ \ AB \rightarrow D \}$? $1NF$ $2NF$ $3NF$ $BCNF$
What is the highest normal form of the relation $R(ABCDEF)$ having functional dependency set at $F = \{ A \rightarrow BC, \ \ C \rightarrow AD, \ \ E \rightarrow ABC, \ \...
User Avatar
3 votes
3 votes
1 answer
3
Bikram asked Aug 26, 2017
673 views
Test by Bikram | Databases | Test 2 | Question: 6
Decompose the following table into BCNF: $R(ABCD)$ $A \rightarrow C$ $C \rightarrow A$ $AB \rightarrow D$ The result is: (AC) (ABD) (AC) (CBD) (AB)(BAD) Both (A) & (B)
Decompose the following table into BCNF:$R(ABCD)$$A \rightarrow C$$C \rightarrow A$$AB \rightarrow D$The result is:(AC) (ABD)(AC) (CBD)(AB)(BAD)Both (A) & (B)
User Avatar
Link Copied!