IE 7374 Data Management for Analytics
Final Examination
(160 minutes)
Points
Problem 1 (page 2) 15
Problem 2 (page 2) 10
Problem 3 (page 3) 20
Problem 4 (page 3-4) 25
Problem 5 (pages 4-5) 15
Problem 6 (pages 5) 15
Total 100
Instructions:
e This exam is a closed-book, closed-notes exam. Books and notes are NOT allowed.
A two-page (two sheets of standard A4 paper, both sides) cheat sheet is allowed.
e Electronics of any kind (smartphones, laptop computers, tablets, calculators, etc.) is NOT
allowed.
Write your answer neatly, clearly, and legibly with good organization.
e Keep your exam sheet and answers to yourself. Peeking, copying, and sharing are strictly
prohibited.
e Write your name on the exam sheet.
e Trips to restrooms must be short and unaccompanied by smartphones, laptop computers, and
tablets.
e Upon completion, please sign the following honor code, organize your answer and the
signed honor code into a SINGLE PDF file, and upload the PDF file to blackboard.
Please Sign the Honor Code: On my honor, I pledge to uphold the values of honesty, integrity, and respect that
are expected of me as a Northeastern student.
Student Name:
Signature:
, IE 7374 Data Management for Analytics
Problem 1 [15 points]. Considering the following EER model
PICKUP-DATE-TIME @ e @ @ ACC-LOCATION
OPERATED BY
= ACCIDENT |
1.1 1..M
CUSTOMER
e |2 points] Identify derived attribute type if there is any
e |3 points] Identify relationship attribute types if there is any
e |5 points] Identify existence dependent entity types if there is any
e |5 points] Identify EER specializations if there 1s any and specify the disjointness constraints
and completeness constraints whenever necessary
Problem 2 [10 points]. The following ER model features a ternary relationship “BOOKING”. Model this
ternary relationship with binary relationship types since ternary relationship is not supported in the
designated DBMS, and draw the updated ER model (relationships and appropriate cardinalities must be
specified clearly)
BOOKING
[ TOURIST ]O"N & 0"Nr HOTEL ]
R TRAVEL
AGENCY
>
Final Examination
(160 minutes)
Points
Problem 1 (page 2) 15
Problem 2 (page 2) 10
Problem 3 (page 3) 20
Problem 4 (page 3-4) 25
Problem 5 (pages 4-5) 15
Problem 6 (pages 5) 15
Total 100
Instructions:
e This exam is a closed-book, closed-notes exam. Books and notes are NOT allowed.
A two-page (two sheets of standard A4 paper, both sides) cheat sheet is allowed.
e Electronics of any kind (smartphones, laptop computers, tablets, calculators, etc.) is NOT
allowed.
Write your answer neatly, clearly, and legibly with good organization.
e Keep your exam sheet and answers to yourself. Peeking, copying, and sharing are strictly
prohibited.
e Write your name on the exam sheet.
e Trips to restrooms must be short and unaccompanied by smartphones, laptop computers, and
tablets.
e Upon completion, please sign the following honor code, organize your answer and the
signed honor code into a SINGLE PDF file, and upload the PDF file to blackboard.
Please Sign the Honor Code: On my honor, I pledge to uphold the values of honesty, integrity, and respect that
are expected of me as a Northeastern student.
Student Name:
Signature:
, IE 7374 Data Management for Analytics
Problem 1 [15 points]. Considering the following EER model
PICKUP-DATE-TIME @ e @ @ ACC-LOCATION
OPERATED BY
= ACCIDENT |
1.1 1..M
CUSTOMER
e |2 points] Identify derived attribute type if there is any
e |3 points] Identify relationship attribute types if there is any
e |5 points] Identify existence dependent entity types if there is any
e |5 points] Identify EER specializations if there 1s any and specify the disjointness constraints
and completeness constraints whenever necessary
Problem 2 [10 points]. The following ER model features a ternary relationship “BOOKING”. Model this
ternary relationship with binary relationship types since ternary relationship is not supported in the
designated DBMS, and draw the updated ER model (relationships and appropriate cardinalities must be
specified clearly)
BOOKING
[ TOURIST ]O"N & 0"Nr HOTEL ]
R TRAVEL
AGENCY
>
