Consider the relation Courses(C, T, H, R, S, G), whose attributes may be thought of informally as: course, teacher, hour, room, student, grade. Let the set of functional dependencies, F, for Courses, be

F = {CT, HRC, HTR, HSR, CSG}

Intuitively, the first FD CT says that a course has a unique teacher, i.e. given a course there is one teacher associated with that course. State what each of the other FDs in F mean.

What are all the candidate keys for Courses?

Verify that there is not a redundant FD in F.

Show that Courses is not in BCNF.

Is Courses in 3NF? Explain why or why not.

Give a BCNF join lossless decomposition of Courses w.r.t. the set of FDs F

Is the decomposition in part (f) dependency preserving? Explain why or why not.

Consider the relation Courses(C, T, H, R, S, G), whose attributes may be thought of informally as: course, teacher, hour, room, student, grade. Let the set of functional dependencies, F, for Courses, be a. Intuitively, the first FD CT says that a course has a unique teacher, i.e. given a course there is one teacher associated with that course. State what each of the other FDs in F mean. b. What are all the candidate keys for Courses? c. Verify that there is not a redundant FD in F. d. Show that Courses is not in BCNF. e. Is Courses in 3NF? Explain why or why not. f. Give a BCNF join lossless decomposition of Courses w.r.t. the set of FDsIF g. Is the decomposition in part (f) dependency preserving? Explain why or why not. Consider the relation Courses(C, T, H, R, S, G), whose attributes may be thought of informally as: course, teacher, hour, room, student, grade. Let the set of functional dependencies, F, for Courses, be a. Intuitively, the first FD CT says that a course has a unique teacher, i.e. given a course there is one teacher associated with that course. State what each of the other FDs in F mean. b. What are all the candidate keys for Courses? c. Verify that there is not a redundant FD in F. d. Show that Courses is not in BCNF. e. Is Courses in 3NF? Explain why or why not. f. Give a BCNF join lossless decomposition of Courses w.r.t. the set of FDsIF g. Is the decomposition in part (f) dependency preserving? Explain why or why not