CS 6360.MS1.  Database Design
Spring 2017
Assignment 3
Sat, Feb 25

Due: Sun, Mar 12 (on elearning).

1. Use the binary decomposition algorithm to decompose the following
   relation into 3NF.  Try to minimize the number of FD's not enforced.
   R(A...K) with the following FDs:
   AB->C	BD->EF		A->I
   AD->GHIJ	H->J		AI->K

2. Use the synthesis algorithm to find a minimal cover of the following
   relation and find the resulting 3NF decomposition.  Show a lossless join
   test of the resulting decomposition.
   R(A...H) with the following FDs:
   A->BC	H->AF		BG->E	C->F
   B->D		AH->G		DG->E

3. 15.31 (p. 536).  Consider the following decompositions for ...