Section B. For each question in this section, you are required
to list all possible candidate...
Section B. For each question in this section, you are required
to list all possible candidate keys for the given
schema based on the functional dependencies provided. You may wish
to compute the closure of
your key(s) to confirms they are valid.
Question 1
R [A, B, C, D, E, F, G, H, I, J]
{A} -> {B}
{C} -> {B}
{B} -> {D, E, F, G, H}
{D, F} -> {I, J, A}
Question 2
R [A, B, C,...
9. Let S = {a,b,c,d,e,f,g,h,i,j}.
a. is {{a}, {b, c}, {e, g}, {h, i, j}} a...
9. Let S = {a,b,c,d,e,f,g,h,i,j}.
a. is {{a}, {b, c}, {e, g}, {h, i, j}} a partition of S?
Explain.
b. is {{a, b}, {c, d}, {e, f}, {g, h}, {h, i, j}} a partition
of S? Explain. c. is {{a, b}, {c, d}, {e, f}, {g, h}, {i, j}} a
partition of S? Explain.
Is
it true that for all subsets A and B of a set U, there is...
Is
it true that for all subsets A and B of a set U, there is a subset
X of U for which A△X⊆B△X? If there is such an X, then prove it (in
particular, say what X can be, and prove your assertion); if there
can fail to be such an X, then give an example where there is no
such X.
Write legibly and do not skip steps.