CS 105 Study Guide - Midterm Guide: Binary Search Algorithm, Proctor, Linear Search

• School: University of Illinois
• Department: Computer Science
• Course: CS 105
• Professor: All

Document Summary

Instructions: we will not answer any questions during this exam. All multiple choice questions only have one best answer. Any errors in the exam will be reviewed after the exam: put your full name and netid on the bubble sheet and on the front of this booklet, this is a closed book exam. Only answers that appear on the bubble sheet will be graded. You can check the boxes if it makes you feel certain you have done them! When instructed to do so you may turn this page over, begin the exam, and answer the questions. Your netid is like jsmith2 and is not just a 9-digit number. Which code snippet(s) will have the variable b equal to 6: only (i, only (i) and (ii, only (i) and (iii, only (ii, (i), (ii), and (iii) For the next two questions, consider the following code: