cs411-s09-mt - NetID CS411 Database Systems Spring 2009...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: NetID: CS411 Database Systems Spring 2009, Prof. Chang Department of Computer Science University of Illinois at Urbana-Champaign Midterm Examination March 3, 2009 Time Limit: 75 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 10 pages. Check if you have missing pages. • The exam is closed book and closed notes. No calculators or other electronic devices are permitted. 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 do not use any additional scratch paper. • Please make your answers clear and succinct; you will lose credit for verbose, convo- luted, or confusing answers. Simplicity does count! • Generally, we think one minute per point is a reasonable allocation of time; 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 8 Total Points 11 16 17 12 14 70 Score Grader 1 NetID: Problem 1 ( 11 points ) Misc. Concepts For each of the following statements, indicate whether it is TRUE or FALSE by circling your choice. You will get 1 point for each correct answer,-0.5 point for each incorrect answer, and 0 point for each answer left blank. (1) Answer: True False Once the schema of a database is set, it cannot be changed. (2) Answer: True False As a query language, SQL is more declarative than relational algebra. (3) Answer: True False Every relationship in an E-R diagram must translate to an individual relation in the relational model. (4) Answer: True False In a table, there is exactly one key , but there can be multiple superkeys ....
View Full Document

This note was uploaded on 02/17/2012 for the course CS 411 taught by Professor Winslett during the Fall '07 term at University of Illinois at Urbana–Champaign.

Page1 / 10

cs411-s09-mt - NetID CS411 Database Systems Spring 2009...

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