Question: 1. {100 points) Consider the Hotel database: (w) This exam is for students with the students' number ending by 0.2.4.6. N: knowing that customer can

 1. {100 points) Consider the Hotel database: (w) This exam is

1. {100 points) Consider the Hotel database: (w) This exam is for students with the students' number ending by 0.2.4.6. N: knowing that customer can make more than one reservation and one reservation is made by only one customer, analyse the riven schema ResCut Re No. Deadline, Cid, C.name. (Street, City) (I) (20 points) Draw all functional dependencies (els) (1) points) Crente a moninpehot by populating the table Rent with, at least, w (1) (+10+ 5 points) Dinc insertion, deletion and modification anomalie Ci (10 pont) Rei INF WHY I molity ReCut topati INF Lt en call Rescut the main relation results out of this step (v) (5 points Draw the file of Re (V) 10 points) Is Recht in 2NPI WHY? If not modify Rew in NP Llechtwere twin (vii) (20 points) IRON WHY I mostly Hapi NF Local and Rethewwww the two relacionin of the (vi) (10 points Draw the correct and Re 1. {100 points) Consider the Hotel database: (w) This exam is for students with the students' number ending by 0.2.4.6. N: knowing that customer can make more than one reservation and one reservation is made by only one customer, analyse the riven schema ResCut Re No. Deadline, Cid, C.name. (Street, City) (I) (20 points) Draw all functional dependencies (els) (1) points) Crente a moninpehot by populating the table Rent with, at least, w (1) (+10+ 5 points) Dinc insertion, deletion and modification anomalie Ci (10 pont) Rei INF WHY I molity ReCut topati INF Lt en call Rescut the main relation results out of this step (v) (5 points Draw the file of Re (V) 10 points) Is Recht in 2NPI WHY? If not modify Rew in NP Llechtwere twin (vii) (20 points) IRON WHY I mostly Hapi NF Local and Rethewwww the two relacionin of the (vi) (10 points Draw the correct and Re

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!