This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: NetID: CS411 Database Systems Fall 2005, Prof. Chang Department of Computer Science University of Illinois at Urbana-Champaign Final Examination December 14, 2005 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 11 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. • Problems that are related to homework ( e.g. , in terms of concepts covered) are marked with [ HW ]. Problem 1 2 3 4 5 6 7 8 Total Points 12 18 10 10 10 10 15 15 100 Score Grader 1 NetID: Problem 1 ( 12 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) True False Transaction management was one of the concepts Ted Codd created in his seminal work of defining the relational model. (2) True False A relation R in 3NF is also in 4NF. (3) True False The second and higher levels must be sparse in an index of multiple levels on sequential files. (4) True False Hash index is efficient in answering range queries, such as “finding products with price higher than 100”. (5) True False The order of insertions into a B+ tree will affect the tree’s final structure at the end. (6) True False The time needed to access a page on disk is comprised of two components: disk seek time and data transfer time....
View Full Document
- Fall '08
- Computer Science, Relational model, relation, NetId