This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 173, Fall 2009 Midterm 2, 4 November 2009 INSTRUCTIONS (read carefully) • Fill in your name, netid, and discussion section time below. Also write your netid on the other pages (in case they get separated). NAME: NETID: DISCUSSION DAY/TIME: • There are 5 problems, on pages numbered 1 through 5. Make sure you have a complete exam. The point value of each problem is indicated next to the problem, and in the table below. • You have 50 minutes to finish the exam. • Points may be deducted for solutions which are correct but excessively complicated, hard to understand, or poorly explained. • Turn in your exam at the front. Show your ID to the proctors. • It is wise to skim all problems and point values first, to best plan your time. • This is a closed book exam. No notes or electronic devices of any kind are allowed. Do all work in the space provided, using the backs of sheets if necessary. See the proctor if you need more paper....
View
Full Document
 Spring '08
 Erickson
 Multiplication, Mathematical Induction, Recursion, Insertion Sort, Big O notation, Multiplication Algorithm

Click to edit the document details