This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: NetID: CS411 Database Systems Fall 2010, Prof. Sinha Department of Computer Science University of Illinois at Urbana-Champaign Final Examination Dec 16, 2010 Time Limit: 180 minutes Print your name and NetID below. In addition, print your NetID in the upper right corner of every page. Name: NetID: Including this cover page, this exam booklet contains 15 pages. Check if you have missing pages. The exam is closed book and closed notes. No calculators or other electronic devices are permitted. You are allowed to use scratch paper. Any form of cheating on the examination will result in a zero grade. Please write your solutions in the spaces provided on the exam. You may use the blank areas and backs of the exam pages for scratch work. Please make your answers clear and succinct; you will lose credit for verbose, convo- luted, or confusing answers. Simplicity does count! Each problem has different weight, as listed below So, plan your time accordingly. You should look through the entire exam before getting started, to plan your strategy. Problem 1 2 3 4 5 6 7 Total Points 30 20 14 14 18 14 10 120 Score Grader 1 NetID: Problem 1 ( 30 points ) Misc. Concepts For each of the following statements, indicate whether the entire statement is TRUE or FALSE by circling your choice. If you feel the statement is partially true and partially false, choose FALSE. You will get 1 . 5 points for each correct answer, 0.5 point for each incorrect answer, and 0 point for each answer left blank. 1. A mathematical definition of a relationship (as in an E/R model) is: if A and B are sets, then a relationship R is a subset of the set A B . TRUE FALSE 2. There is no formal way to specify multiple keys in an E/R diagram. TRUE FALSE 3. A weak entity set is not an entity set, it is a special type of relationship between two entity sets. TRUE FALSE 4. Lets say you examined all the tuples in a relation at a particular time, and found that no two tuples have the same value for a particular attribute A. You can designate A to be a key for the relation. TRUE FALSE 5. SQL allows you to not only create a new table, but also to delete an existing table from the database. TRUE FALSE 6. In translating subclass entity sets into the relational model, the use nulls approach creates the fewest relations. TRUE FALSE 7. In relational algebra, the schema of R1 R2 includes the attributes of R1 that are not attributes of R2. TRUE FALSE 8. A Theta-join is a Cartesian product operation followed by a projection operation....
View Full Document
- Fall '07
- Computer Science