ICS 324 – HW 3<\/p>\n
Due November 27, 2021<\/p>\n
Solve the following normalization questions.<\/p>\n
[4 pts] Consider the relation R = {A, B, C, D, E, F, G, H, I, J} and functional dependencies <\/p>\n
{A,B} {C}<\/p>\n
{A} {D,E} <\/p>\n
{B} {F} <\/p>\n
{F} {G,H} <\/p>\n
{D} {I,J}<\/p>\n
What is the key for R? Decompose R into 2NF and then 3NF relations.<\/p>\n
[4 pts] Consider a relation R = {A, B, C, D, E} with the following dependencies. <\/p>\n
{A, B} {C}<\/p>\n
{C, D} {E}<\/p>\n
{D, E} {B}<\/p>\n
Is AB a candidate key of R? What about ABD? Explain your answer.<\/p>\n
[4 pts] Consider the relation R, which has attributes that hold schedules of courses and sections at a university; <\/p>\n
R = {Course_no, Sec_no, Offering_dept, Credit_hours, Course_level, Instructor_ssn, Semester, Year, Days_hours, Room_no, No_of_students}. <\/p>\n
Suppose that the following functional dependencies hold on R:<\/p>\n
{Course_no} \u2192 {Offering_dept, Credit_hours, Course_level}<\/p>\n
{Course_no, Sec_no, Semester, Year} \u2192 {Days_hours, Room_no, No_of_students, Instructor_ssn}<\/p>\n
{Room_no, Days_hours, Semester, Year} \u2192 {Instructor_ssn, Course_no, Sec_no}<\/p>\n
Try to determine which sets of attributes form keys of R. How would you normalize this relation?<\/p>\n
[4 pts] This exercise asks you to convert business statements into dependencies.<\/p>\n
Consider the relation DISK_DRIVE (Serial_number, Manufacturer, Model, Batch, Capacity, Retailer). Each tuple in the relation DISK_DRIVE contains information about a disk drive with a unique Serial_number, made by a manufacturer, with a particular model number, released in a certain batch, which has a certain storage capacity and is sold by a certain retailer. For example, the tuple Disk_drive (\u20181978619\u2019, \u2018WesternDigital\u2019, \u2018A2235X\u2019, \u2018765234\u2019, 500, \u2018CompUSA\u2019) specifies that WesternDigital made a disk drive with serial number 1978619 and model number A2235X, released in batch 765234; it is 500GB and sold by CompUSA. Write each of the following dependencies as an FD:<\/p>\n
The manufacturer and serial number uniquely identifies the drive.<\/p>\n
A model number is registered by a manufacturer and therefore can\u2019t be used by another manufacturer.<\/p>\n
All disk drives in a particular batch are the same model.<\/p>\n
All disk drives of a certain model of a particular manufacturer have exactly the same capacity.<\/p>\n
[4 pts] Consider the following relation:<\/p>\n
CAR_SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice)<\/p>\n
This relation refers to options installed in cars (e.g., cruise control) that were sold at a dealership, and the list and discounted prices of the options. If <\/p>\n
CarID \u2192 Sale_date <\/p>\n
Option_type \u2192 Option_listprice <\/p>\n
CarID, Option_type \u2192 Option_discountedprice <\/p>\n
Argue using the generalized definition of the 3NF that this relation is not in 3NF. Then argue from your knowledge of 2NF, why it is not even in 2NF.<\/p>\n
[4 pts] Consider relation R = {A, B, C, D, E} with the following dependencies. <\/p>\n
{A} \u2192 {C}<\/p>\n
{B, D} \u2192 {A}<\/p>\n
{D} \u2192 {E}<\/p>\n
Decompose R into BCNF. In each step, explain which functional dependency you used to
decompose and explain why further decomposition is needed. And also make sure you indicate the keys for each relation.<\/p>\n","protected":false},"excerpt":{"rendered":"
ICS 324 – HW 3 Due November 27, 2021 Solve the following normalization questions. [4 pts] Consider the relation R = {A, B, C, D, E, F, G, H, I, J} and functional dependencies {A,B} {C} {A} {D,E} {B} {F} {F} {G,H} {D} {I,J} What is the key for R? Decompose R into 2NF and […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10],"class_list":["post-78099","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-writing"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/78099","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=78099"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/78099\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=78099"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=78099"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=78099"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}