Relational Algebra Operations Union intersection Difference Product Selection Projection Join Query Structured Query Language What is SQL? Query SELECT/FROM/WHERE. GROUP BY/HAVING Nested Query Consider the following mini world description and draw an ER diagram. Make sure that your diagram is clear and all annotations are legible. Identify all relationships, relations, weak entities, multi valued attributes, primary keys, cardinality and participation constraints. Clearly write any assumptions that you make. A college contains many departments Each department has a unique ID, a name, and a set of buildings that comprise the department's location Each department can offer any number of courses as long as they offer at least one course. Courses may be cross-listed over different departments. A cross-listed course is stored only once by the course id number. Many instructors can work for a department An instructor can work only in one department An instructor has an id, a phone number, a first_name, and a last_name For each department there is a single Head that chairs the department An instructor can be head of only one department An instructor can teach any number of courses, but is not required to teach a class. A course can be taught by only one instructor The courses have an id number, a duration, and a name. Each student enrolls for any number of courses. A student does not need to be enrolled in courses. Each course can have any number of students. Students are determined by their student id number. In addition, the first_name, the last_name, and a phone number are stored for each student. Relational Algebra Operations Union intersection Difference Product Selection Projection Join Query Structured Query Language What is SQL? Query SELECT/FROM/WHERE. GROUP BY/HAVING Nested Query Consider the following mini world description and draw an ER diagram. Make sure that your diagram is clear and all annotations are legible. Identify all relationships, relations, weak entities, multi valued attributes, primary keys, cardinality and participation constraints. Clearly write any assumptions that you make. A college contains many departments Each department has a unique ID, a name, and a set of buildings that comprise the department's location Each department can offer any number of courses as long as they offer at least one course. Courses may be cross-listed over different departments. A cross-listed course is stored only once by the course id number. Many instructors can work for a department An instructor can work only in one department An instructor has an id, a phone number, a first_name, and a last_name For each department there is a single Head that chairs the department An instructor can be head of only one department An instructor can teach any number of courses, but is not required to teach a class. A course can be taught by only one instructor The courses have an id number, a duration, and a name. Each student enrolls for any number of courses. A student does not need to be enrolled in courses. Each course can have any number of students. Students are determined by their student id number. In addition, the first_name, the last_name, and a phone number are stored for each student