Homework $1$

Q$1(2$ pt$)$: For the following binary relationships, suggest the key constraint $($one$-$to$-$one, one$-$to$-$many, many$-$to$-$one, many$-$to$-$many$)$ based on the commonsense meaning of the entity types. Clearly state any assumptions you make. Make sure including both side of assumptions.

V OneCard vs$.$ UTRGV Student one $-$ to$-$one

Classroom vs$.$ Wall

Q$2(1$ pt$)$: Draw the ER diagram for $1-2$ in Q$1.$

Q$3(2$ pt$)$: You are a senior database infrastructure engineer hired by a university. They ask you to design an efficient database to store their faculty and courses data. The requirements for the database are as follows:

For each faculty, the database stores name, ID$,$ and Date of Birth.

A faculty is uniquely identified by his$/$her ID$.$

For each course, the database stores a CID $($Course ID$),$ Name, Section Number

A course is uniquely identified by its CID.

A course should be taught by at most one faculty.

A faculty can teach any number of courses.

The first task to create the database is designing the E$-$R diagram. Please draw your $E-R$ diagram to model all the requirements. Do not forget to draw the constraints.