Question: Problem 1 . Consider a relation R ( A , B , C , D , E ) with the following dependencies: AB C ,

Problem 1. Consider a relation R(A, B, C, D, E) with the following dependencies: AB C, CD E, DE B Is AB a candidate key of this relation? If not, is ABD? Explain your answer. Problem 2. Consider the following relation: CAR_SALE(Car#, Date_sold, Salesperson#, Commission%, Discount_amt) Assume that a car may be sold by multiple salespeople, and hence {Car#, Salesperson#} is the primary key. Additional dependencies are Date_sold Discount_amt and Salesperson# Commission% Based on the given primary key, is this relation in 1NF,2NF, or 3NF? Why or why not? How would you successively normalize it completely? Problem 3. Consider the following relation for published books: BOOK (Book_title, Author_name, Book_type, List_price, Author_affil, Publisher) Author_affil refers to the affiliation of author. Suppose the following dependencies exist: Book_title Publisher, Book_type Book_type List_price Author_name Author_affil a. What normal form is the relation in? Explain your answer. b. Apply normalization until you cannot decompose the relations further. State the reasons behind each decomposition.

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 Programming Questions!