Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Q1 ): You are about to design a university database to keep information about departments, professors, and course offerings. Here is what you have been told about this application. Departments are identified by a code (e.g. CSE) and have a name (e.g., "Computer Science and Engineering"). Professors are identified by their initials (like "MNK1"), they have a name, and they are affiliated with at least one department. Professors are either tenured ("tenured" means permanent) or junior (they have to be in one of these categories and they cannot be in both). For tenured professors we want to know the year they earned tenure (year when they became permanent) and for junior professors we want to know the date they were hired. Finally, a department has exactly one chairperson who must be a tenured professor in any department (i.e., there is no requirement that the chairperson is affiliated with the department s/he chairs). A department (e.g., CSE) lists courses to be offered to students for the next semester (whatever that next semester might be). A course is listed by exactly one department (no cross listings). A course has a name (e.g., "Intro to DB"), a description (e.g., "The best course on planet earth"), and a course number (e.g., "CSE311") which is unique among all courses offered by the same department. Courses have one or more sections - sections of a particular course are uniquely identified by section number (1, 2, 3, etc.). Each section includes information about the lecture time and classroom, the enrollment cap, and the instructor. There must be at least one instructor for each section. The instructor of a section of a particular course must be a professor (tenured or not, it doesn't matter) who may or may not be affiliated with the department that lists the course. Draw an ER diagram to capture the situation described above. Make sure you capture as many integrity constraints as possible and explicitly mention those that cannot be captured by the ER diagram (if any). Make sure that your E/R diagrams are clear and unambiguous (e.g., your bold lines look unmistakably bold, your arrowheads look unmistakably like arrowheads, etc.). You will not receive the hiquit

Q1 ): You are about to design a university database to keep information about departments, professors, and course offerings. Here is what you have been told about this application. Departments are identified by a code (e.g. CSE) and have a name (e.g., "Computer Science and Engineering"). Professors are identified by their initials (like "MNK1"), they have a name, and they are affiliated with at least one department. Professors are either tenured ("tenured" means permanent) or junior (they have to be in one of these categories and they cannot be in both). For tenured professors we want to know the year they earned tenure (year when they became permanent) and for junior professors we want to know the date they were hired. Finally, a department has exactly one chairperson who must be a tenured professor in any department (i.e., there is no requirement that the chairperson is affiliated with the department s/he chairs). A department (e.g., CSE) lists courses to be offered to students for the next semester (whatever that next semester might be). A course is listed by exactly one department (no cross listings). A course has a name (e.g., "Intro to DB"), a description (e.g., "The best course on planet earth"), and a course number (e.g., "CSE311") which is unique among all courses offered by the same department. Courses have one or more sections - sections of a particular course are uniquely identified by section number (1, 2, 3, etc.). Each section includes information about the lecture time and classroom, the enrollment cap, and the instructor. There must be at least one instructor for each section. The instructor of a section of a particular course must be a professor (tenured or not, it doesn't matter) who may or may not be affiliated with the department that lists the course. Draw an ER diagram to capture the situation described above. Make sure you capture as many integrity constraints as possible and explicitly mention those that cannot be captured by the ER diagram (if any). Make sure that your E/R diagrams are clear and unambiguous (e.g., your bold lines look unmistakably bold, your arrowheads look unmistakably like arrowheads, etc.). You will not receive the hiquit

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Q1 ): You are about to design a university database to keep information about departments, professors, and course offerings. Here is what you have been told about this application. Departments are identified by a code (e.g. CSE) and have a name (e.g., "Computer Science and Engineering"). Professors are identified by their initials (like "MNK1"), they have a name, and they are affiliated with at least one department. Professors are either tenured ("tenured" means permanent) or junior (they have to be in one of these categories and they cannot be in both). For tenured professors we want to know the year they earned tenure (year when they became permanent) and for junior professors we want to know the date they were hired. Finally, a department has exactly one chairperson who must be a tenured professor in any department (i.e., there is no requirement that the chairperson is affiliated with the department s/he chairs). A department (e.g., CSE) lists courses to be offered to students for the next semester (whatever that next semester might be). A course is listed by exactly one department (no cross listings). A course has a name (e.g., "Intro to DB"), a description (e.g., "The best course on planet earth"), and a course number (e.g., "CSE311") which is unique among all courses offered by the same department. Courses have one or more sections - sections of a particular course are uniquely identified by section number (1, 2, 3, etc.). Each section includes information about the lecture time and classroom, the enrollment cap, and the instructor. There must be at least one instructor for each section. The instructor of a section of a particular course must be a professor (tenured or not, it doesn't matter) who may or may not be affiliated with the department that lists the course. Draw an ER diagram to capture the situation described above. Make sure you capture as many integrity constraints as possible and explicitly mention those that cannot be captured by the ER diagram (if any). Make sure that your E/R diagrams are clear and unambiguous (e.g., your bold lines look unmistakably bold, your arrowheads look unmistakably like arrowheads, etc.). You will not receive the benefit of the doubt in the presence of ambiguity.
Transcribed Image Text:Q1 ): You are about to design a university database to keep information about departments, professors, and course offerings. Here is what you have been told about this application. Departments are identified by a code (e.g. CSE) and have a name (e.g., "Computer Science and Engineering"). Professors are identified by their initials (like "MNK1"), they have a name, and they are affiliated with at least one department. Professors are either tenured ("tenured" means permanent) or junior (they have to be in one of these categories and they cannot be in both). For tenured professors we want to know the year they earned tenure (year when they became permanent) and for junior professors we want to know the date they were hired. Finally, a department has exactly one chairperson who must be a tenured professor in any department (i.e., there is no requirement that the chairperson is affiliated with the department s/he chairs). A department (e.g., CSE) lists courses to be offered to students for the next semester (whatever that next semester might be). A course is listed by exactly one department (no cross listings). A course has a name (e.g., "Intro to DB"), a description (e.g., "The best course on planet earth"), and a course number (e.g., "CSE311") which is unique among all courses offered by the same department. Courses have one or more sections - sections of a particular course are uniquely identified by section number (1, 2, 3, etc.). Each section includes information about the lecture time and classroom, the enrollment cap, and the instructor. There must be at least one instructor for each section. The instructor of a section of a particular course must be a professor (tenured or not, it doesn't matter) who may or may not be affiliated with the department that lists the course. Draw an ER diagram to capture the situation described above. Make sure you capture as many integrity constraints as possible and explicitly mention those that cannot be captured by the ER diagram (if any). Make sure that your E/R diagrams are clear and unambiguous (e.g., your bold lines look unmistakably bold, your arrowheads look unmistakably like arrowheads, etc.). You will not receive the benefit of the doubt in the presence of ambiguity.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS