Question
1. Given the relation R(A, B, C, D, E, G) and the function dependencies FD1: A -> B FD2: E -> D FD3: {E,G} ->
1. Given the relation R(A, B, C, D, E, G) and the function dependencies
FD1: A -> B
FD2: E -> D
FD3: {E,G} -> {A, C}
1a. Draw the dependency diagram for this relation
1b. Identify all candidate keys using either the synthesis OR decomposition method. Show each step.
Candidate key(s):
1c. Is the relation in 2NF? _____
1d. Why or why not?
1e. Write the relation(s) in 2NF here, the FDs, and candidate keys for each relation. If already in 2NF, just write the relation:
1f. Are the relation(s) you provided in question 1e in 3NF? ______
1g. Why or why not?
1h. Write the relation(s) in 3NF here, the FDs, and candidate keys for each relation. If already in 3NF, just write the relation(s):
PLEASE SHOW ALL WORK
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started