Consider the relation Courses (C, T, H, R, S, G), whose attributes may be thought of...

 

Transcribed Image Text:

Consider the relation Courses (C, T, H, R, S, G), whose attributes may be thought of informally as course, teacher, hour, room, student, and grade. Let the set of FD's for Courses be C→ T. HR → C. HT→ R, HSR, and CS → G. Intuitively, the first says that a course has a unique teacher, and the second says that only one course can meet in a given room at a given hour. The third says that a teacher can be in only one room at a given hour, and the fourth says the same about students. The last says that students get only one grade in a course. a) What are all the keys for Courses? b) Verify that the given FD's are their own minimal basis. c) Use the 3NF synthesis algorithm to find a lossless-join, dependency-preserving decomposition of R into 3NF relations. Are any of the relations not in BCNF? Consider the relation Courses (C, T, H, R, S, G), whose attributes may be thought of informally as course, teacher, hour, room, student, and grade. Let the set of FD's for Courses be C→ T. HR → C. HT→ R, HSR, and CS → G. Intuitively, the first says that a course has a unique teacher, and the second says that only one course can meet in a given room at a given hour. The third says that a teacher can be in only one room at a given hour, and the fourth says the same about students. The last says that students get only one grade in a course. a) What are all the keys for Courses? b) Verify that the given FD's are their own minimal basis. c) Use the 3NF synthesis algorithm to find a lossless-join, dependency-preserving decomposition of R into 3NF relations. Are any of the relations not in BCNF?

Answer rating: 100% (QA)

a The keys for Courses are Course C Teacher T Room R Student S Grade G b To verify that the given FDs are their own minimal basis we need to show that none of the FDs can be removed without losing the ... View the full answer