08 Normalization I

.docx

School

Ohio State University *

*We aren’t endorsed by this school

Course

3241

Subject

Computer Science

Date

Dec 6, 2023

Type

docx

Pages

2

Uploaded by JusticeSeahorse1284

Report
CSE 3241 In-Class Assignment – 08 Normalization I Names Date 1. Consider the following relation: DiskDrive(serialNumber , manufacturer, model, batch, capacity, retailer). Each tuple in the relation DiskDrive contains information about a disk drive with a unique serialNumber, made by a manufacturer, with a particular model, released in a certain batch, which has a certain storage capacity, and is sold by a certain retailer. For example, the tuple DiskDrive(1978619, WesternDigital, A2235X, 765234, 500, BestBuy) specifies that WesternDigital made a disk drive with serial number 1978619, model number A2235X in batch 765235 with 500GB that is sold by BestBuy. Write each of the following dependencies as an FD: a. The manufacturer and serial number uniquely identifies the drive b. A model number is registered by a manufacturer and hence can’t be used by another manufacturer. c. All disk drives in a particular batch are the same model. d. All disk drives of a particular model of a particular manufacturer have exactly the same capacity. 2. Consider the following relation: SERVICE(MechanicId, VehicleId , Date , Charge, Symptoms, RepairCode) A tuple in SERVICE describes an automobile service at a garage. Symptoms is a string indicating the problem the vehicle owner reported, RepairCode is a code indicating the repairs that were performed, and Charge is the amount charged to the customer. Assume that each type of repair (as indicated by repair code) has a fixed charge based only on the repair (i.e. different repairs for the same repair code cost the same amount even on different types of vehicles). Assume that the same symptoms don’t necessarily lead to the same repair. a. What are the functional dependencies given the above relation and the given assumptions? Include the FDs for the primary key.
b. Is the relation in 2NF? Why or why not? If not, show how you can decompose it to get it into 2NF c. Is your answer to part b (either the original relation or your decomposition) in 3NF? Why or why not? If not, show how you can decompose it to get it into 3NF 3. Consider the relation R2(CourseNo , DeptNo, Credits, SectionNo , Instructor, RoomNo) with functional dependencies: CourseNo DeptNo; CourseNo Credits; {CourseNo,SectionNo} Instructor; {CourseNo, SectionNo} RoomNo a. Given the above information, what normal form is R2 in? Give your reasons for why it is not in a higher one. b. Normalize the above into the next highest normal form. 4. Multiple Choice (circle only one answer): a. The functional dependency A B for relation schema R(A,B,C,D) implies that: a. No two tuples in R can have the same value for the attribute B b. Any two tuples in R that have the same value for B must have the same value for A c. No two tuples in R can have the same value for A d. Any two tuples in R that have the same value for A must have the same value for B b. If {A,B} {C,D} is the only functional dependency that holds for relation R(A,B,C,D), then: a. {A,B} is a candidate key for R b. No two tuples in R can have the same values for both A and B c. {A,B} is the primary key of R d. All of the above c. Given only the relation schema: Books(Title ,Author , Year, Publisher) we can infer the following functional dependency: a. {Author, Publisher} Publisher b. Title Author c. Year Publisher d. Author Publisher d. Given the relation schema R(A,B,C,D,E) and the functional dependencies: {A,B} {C,D,E}; C E; B D, what is the highest normal form of R? a. 1NF b. 2NF c. 3NF d. None of the above
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help