hw1 - Michael Burns CS440 Homework #1 10.17: Design a...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Michael Burns CS440 Homework #1 10.17: Design a relational database schema for this database application. Student Relation: {ssn , snum , sname, sc_addr, sc_phone, sp_addr, sp_phone, bdate, sex, class, major_code, minor_code, prog} Functional Dependencies: ssn , snum sname, sc_addr, sc_phone, sp_addr, sp_phone, bdate, sex, class, major_code, minor_code, prog Department Relation: {dname , dcode , doffice, dphone, dcollege} Functional Dependencies: dname , dcode doffice, dphone, dcollege Course Relation: {cnum , cname , cdesc, credit, level, c_dep} Functional Dependencies: cnum , cname cdesc, credit, level, c_dep Section Relation: {sec_num , name, semester, year, sec_course} Functional Dependencies: sec_num Iname, semester, year, sec_course Grade Record Relation: {ssn , sec_num , grade} Functional Dependencies: ssn , sec_num grade
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10.18: Prove or disprove the following rules: a. W Y, X Z = WX Y IR2 (AUGMENTATION): If W Y then WX YX This also means that WX Y and WX X True b. X Y, Y Z = X Z IR1 (RELFECTIVE): If Y Z then Y Z IR3 (TRANSITIVE): If X Y and Y Z then X Z True c. X Y, X W, WY
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/28/2009 for the course CS 440 taught by Professor Staff during the Spring '08 term at Oregon State.

Page1 / 5

hw1 - Michael Burns CS440 Homework #1 10.17: Design a...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online