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: CS 173, Fall 2009 Final Exam, 17 December 2009 Fill in your name, netid, and discussion section time below. Also write your name or netid on the last page (which sometimes gets pulled off). NAME: NETID: DISCUSSION DAY/TIME: Problem 1 2 3 4 5 Possible 8 13 11 12 8 Score Problem 6 7 8 9 10 Possible 10 9 9 10 10 Score Total out of 100 points INSTRUCTIONS (read carefully) • There are 10 problems, each on a single page. Make sure you have a complete exam. • The point value of each problem is indicated next to the problem. • It is wise to skim all problems and point values first, to best plan your time. • Points may be deducted for solutions which are correct but excessively complicated, hard to understand, or poorly explained. • Brief explanations and/or showing work may increase partial credit for buggy answers. • We expect most people to finish the exam in 2 hours, but you can take up to the full 3 hours. • Turn in your exam at the front. Show your ID to the proctors. • This is a closed book exam. No notes or electronic devices of any kind are allowed. • Except where explicitly indicated, it isn’t necessary to simplify or calculate out complex constant expressions such as (0 . 7) 3 (0 . 3) 5 , . 15 3 . 75 , 7!, ( 10 7 ) , and the like. • Do all work in the space provided, using the backs of sheets if necessary. See the proctor if you need more paper. • Please bring any apparent bugs to the attention of the proctors. • After the exam is over, discuss its contents with other students only after verifying that they have also taken the exam (e.g. they aren’t about to take a conflict exam). Problem 1: Multiple choice (8 points) Check the appropriate box for each statement. (One box per statement.) If you change yourCheck the appropriate box for each statement....
View
Full Document
 Spring '08
 Erickson
 Inductive Reasoning, Equivalence relation, Fibonacci number, θ, Rajiv

Click to edit the document details