Computer Science Question

the file with questions is attached

Assignment 1 (databases)
This assignment covers the first and second sections of the course:
•
•
data modelling via Entity Relationship (ER) model;
Relational Model (tables).
You should submit a single PDF file containing the solutions for Problem 1 and
Problem 2. This can be a scanned copy of your hand-drawn diagram, or you can use
any drawing software) that allows you to create ER diagrams with the notationtaught in
class. In either case, the result must be clearly legible.
You will need to submit this coursework via the Moodle page of the module.
Questions about the assignment received within two working days before the
deadline might not be answered.
NOTE: All the work you submit should be solely your own. Coursework
submissions are routinely checked for this.
————————————————————————————–Problem 1 (50 marks)
(a)
The department of Computer Science needs a database for monitoring the Final
Year Projects of the students and their supervisors. Its desired design is
described below.
• For every staff member the system stores their username, which is unique, and
a list of emails.
• For every student the system stores their academic year and their
email address.
• Each student is associated with two staff members: one staff member acts as
the supervisor and another staff member acts as a marker. There can exist staff
members who are not supervising or marking any students.
• In addition, the system stores the available topics for the Final
Year Projects. For every topic, the system stores its ID and its description. Finally,
the system stores the topic of the Final Year Project of every student. There can
exist topics that no student studies. Every student studies exactly one topic.
Draw an E-R diagram according to the above design.
Remember to include all constraints.
————————————————————————————–Problem 2 (50 marks)
Convert the following E-R diagram into a relational model. Present the relational model,
including primary key and foreign key information. Minimize as far as possible.