cs411-s09-final - NetID: CS411 Database Systems Spring...

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

View Full Document Right Arrow Icon
NetID: CS411 Database Systems Spring 2009, Prof. Chang Department of Computer Science University of Illinois at Urbana-Champaign Final Examination May 8, 2009 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. You are allowed to use scratch papers. 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 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 8 Total Points 32 16 10 10 10 12 17 13 120 Score Grader 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
NetID: Problem 1 ( 32 points ) Misc. Concepts For each of the following statements, indicate whether it is TRUE or FALSE by circling your choice. You will get 2 point for each correct answer, -1.0 point for each incorrect answer, and 0 point for each answer left blank. (1) True False If two relations are both in BCNF, their join must also be in BCNF. (2) True False Transaction management consists of two main functional components: concurrency control and failure recovery . (3) True False SQL Injection attacks a Web site by manipulating the user input to cause harmful SQL commands to be executed at the backend database. (4) True False Relational algebra was invented to formalize the underlying operations of the SQL language. (5) True False When translating an E-R diagram to the relational model, there are multiple ways to translate a sub-class relationship. (6) True False With respect to a set of integers, there exists a unique structure to index them in a B+ tree. (7) True False In determining a query plan involving joins, by focusing on only left-deep join trees, we are not guaranteed to generate the optimal query plan. (8) True False Regardless of UNDO or REDO, a logging system must write the corresponding log entry before any update of database values on disk. (9) True False In cost-based optimization, dynamic programming is a technique that helps us to estimate the cost of a query plan.
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 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 / 15

cs411-s09-final - NetID: CS411 Database Systems Spring...

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