retagged by
355 views
3 votes
3 votes

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 \}$?

  1. $1NF$
  2. $2NF$
  3. $3NF$
  4. $BCNF$
retagged by

1 Answer

Best answer
5 votes
5 votes
If we find the candidate keys here we can clearly see that (A, C, E, F) are candidate keys. hence CD and AB are also superkeys.

so all the FD's will be like SUPERKEY-> ATTRIBUTE. that;s the only condition for BCNF. hence it is in BCNF normal form.
selected by
Answer:

Related questions

3 votes
3 votes
1 answer
2
Bikram asked Aug 26, 2017
637 views
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)
1 votes
1 votes
2 answers
4
Bikram asked Aug 26, 2017
318 views
The relation R (ABCDE) with FD set $\{AB \rightarrow CDE, \ A \rightarrow C, \ C \rightarrow D\}$ is in which of the following normal forms? 1NF but not in 2NF in both 2...