1. Functional Dependencies
Consider a relation R (A,B,C,D,E,F,G,H,J) with the following functional dependencies:
AB --> CD
H --> B
G --> DA
C --> BG
CD --> EF
A --> HJ
J --> G
Find minimal cover and identify all possible candidate keys.
2. Normalize the following relations to 3NF, using the set of functional dependencies listed:
1. R(A,B,C,D,E)
FDs: B --> C, D --> E & AD --> B
2. R(A,B,C,D,E)
FDs: C --> B & AB --> DEC
3. R(A,B,C,D,E)
FDs: C --> B, D --> E & AB --> DEC
Your submission should clearly identify the steps required to normalize the relation to 3NF and demonstrate that the solution is lossless and preserves all functional dependencies