<p> Name ______</p><p>Advanced Management Information Systems (MIS 408) Exam #2 (November 21, 2013), 100 points</p><p>SHOW YOUR WORK CLEARLY !!!!</p><p>1) Explain 5 of the following 6 terms in detail!!!. (20 points)</p><p>1. 2NF 2. Anomalies (update, insert, delete) 3. Candidate key 4. Transitive dependencies 5. Minimal cover of set of functional dependencies 6. Normalization 2) Classify each of the following relations as 1NF, 2NF, or 3NF (state any assumptions you make). Identify the key of each relation and Normalize relations into 3NF that are lossless join if they are in 1NF or 2NF. (30 points) </p><p> a) Car_Rental (Bill#, CarId, CustomerId, Sales_Rep_Num, Cust_Fname, Date_Returned, Cust_Lname, Car_year, Bill_Date, Car_type, Cust_Phone#, Sales_Rep_Phone#, Car_Color, Date_Rented, Sales_Rep_Name, Total_Rental_Amt, Sales_Rep_Email)</p><p>Key: Normal Form: </p><p>3NF relations:</p><p>Discuss why the original design is not an appropriate table structure – discuss in term of anomalies (insert, update, and delete). b) Airline_reservation(Reservation_Num, Airlines, FL_Duration, Departure_Date, Passenger_Fname, Dep_Time, Arrival_Time, Dep_Airport, Arrival_Airport, Passenger_ID, TicketPrice, Seat#, Passenger_Lname, Passenger_Phone, Flight_Num)</p><p>Key: Normal Form: </p><p>3NF relations:</p><p>Discuss why the original design is not an appropriate table structure – discuss in term of anomalies (insert, update, and delete). c) AutoParts(Order_Total_Amount, Cust_Num, Part_Num, Shipping_Cost, Shipping_Company, Qty_Order_Per_Part, Part_Name, Cust_Phone, Cust_Lname, Part_Price, Sub_Total_Per_Product, Shipping_Num, Date_Delivery, Company_Produced_Part, Cust_Fname, Part_Size, Order_Date, Order_Num)</p><p>Key: Normal Form: </p><p>3NF relations:</p><p>Discuss why the original design is not an appropriate table structure – discuss in term of anomalies (insert, update, and delete). 3) The set of functional dependencies F of relation R(IJKLMNOPQRST) is (20 points)</p><p>I  J, K, S, P, Q, M K  K, S, L K, J, M  L, S I, P  Q, M P  Q, J, M, N L  M, N M  N R  S R, K, P  S</p><p> a) Find a minimal cover of the set F. b) Find a candidate key for the relation R c) Find a lossless join decomposition of R into 3NF (do not have to show the proof of lossless join) 4a) Use the following set of rules of inference FDs (20 points)</p><p>IR1 (reflexive rule) if X  Y, then X  Y IR2 (augmentation rule) if X  Y then XZ  YZ IR3 (transitive rule) if {X  Y, Y  Z} then X  Z</p><p>To prove the following rules for functional dependencies</p><p>1. X  LMNY, Z  WKL |== XZ  YK</p><p>2. X  WLN, X  KMY, KMWY  S |== X  S</p><p>3. X  YJL and J  KMYZ |== X  JKM</p><p>4b) Discuss how Armstrong’s axioms help in doing normalization. (10 points)</p>