This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS4604 Midterm October 12, 2006 Please enter the following information: Name: 9 digit ID: Please do not write below this line. Question Maximum Score Score 1 5 2 5 3 5 4 10 5 15 6 20 7 40 Total 100 1 1. (5 points) Circle True or False . A manymany relationship R connects entity sets E and F . In an E/R diagram, we can use a rounded arrow directed towards F to indicate that R has referential integrity from E to F . 2. (5 points) Circle True or False . R is a relation in 4NF. If the MD A BC holds in R and is nontrivial, then the FD A BC holds in R . 3. (5 points) Circle all the possibilities that correctly complete the sentence: The closure of a set of attributes is a set of . (a) functional dependencies (b) attributes (c) keys (d) FDs (e) multivalued dependencies 2 4. (10 points) Draw an E/R diagram to model project groups in CS4604. Keep in mind that each enrolled student (identified by a PID) can work at most one project. Each project, identified uniquely by its name, can have at most two groups working on it. Be sure to identify all the appropriate multiplicity and referential integrity constraints in the diagram. Indicate key attributes in each entity set. As always, use Notes: to identify aspects of the problem that you cannot model. 3 5. (15 points) A key is simple if it consists of only one attribute. Prove that if a relation R is in 3NF and if every key in R is simple, then R is in BCNF. Your proof should be general, e.g., it should not assume that R has a fixed number of, say two or three, attributes....
View
Full
Document
This note was uploaded on 12/24/2011 for the course CS 4604 taught by Professor Cmmalik during the Fall '08 term at Virginia Tech.
 Fall '08
 CMMALIK

Click to edit the document details