Check Whether Relation Is Boyce-Codd Normal Form


Consider a relation R(A, B, C, D, E, F), with FDs AB → C , BC → D, D → E, BE → F and DF → C.

1. Is R in BCNF? Explain why or why not.
2. Find the closure of the following:

1. (A, B)
2. (B, D)
3. (D, F)

3. List one superkey of R that is not a (minimal) key.


The question belongs to Computer Science and it is about finding out whether or not a relation comes under BCNF (Boyce-Codd Normal Form) or not. This has been given in the solution in detail.

Total Word Count 40

Download Full Solution


  • HWA

    this is a very good website

  • HWA

    I have 50 questions for the same test your page is showing only 28

  • HWA

    hi can you please help or guide me to answer my assignments. thanks

  • HWA

    hi can anyone help or guide me to my assignments. thanks

  • HWA

  • HWA

    This solution is perfect ...thanks

  • HWA

    Hello Allison,I love the 2nd image that you did! I also, had never heard of SumoPaint, is something that I will have to exolpre a bit! I understand completely the 52 (or so) youtube videos that you probably watched. Sometimes they have what you want, sometimes they don't! However, it is always satisfying when you are able to produce something that you have taught yourself. Great job!Debra 0 likes

  • HWA

    Perfect bank of solution. 

  • HWA

    great !

  • HWA
    Paul Brandon-Fritzius

    thanks for the quick response. the solution looks good. :)

  • HWA
    tina Johnson

    thnx for the answer. it was perfect. just the way i wanted it. 

  • HWA

    works fine.