Dear Students, Our Midterm 2 is quickly approaching (Tuesday).

It will be the same style as last midterm: 25 multiple choice questions. I wanted to update you all with some important information regarding the midterm. First, I will have office hours on Tuesday from 1-4pm instead of Friday 1-4pm to answer any last minute questions about the midterm or to help with Project 4. Dr. Martino has office hours on Monday. *** important *** we will be adopting a seating chart, it will be posted tomorrow (Monday) evening via email as well as Piazza Things to review: 1) Questions from last semester on midterm 1 and midterm 2 (list posted on piazza) 2) Go over your preLabs (1-5, 9-11, but focus on: 9,10,11) 3) Chapters 5 and 11 in the book 4) Python wiki book topics: Strings, Lists, Tuples, Dictionaries 5) Lecture slides/examples/clicker questions 6) practice string operations: slicing, split, find, rfind 7) be familiar with the random module and its methods: random() and choice() (you do not need to know the urllib and os modules) What should I know from the complexity lecture / debugging recitation? 1) Be able to identify the growth term (term which will be the largest when n is very large) 2) Be able to identify which big oh (ie O(...) ) is the least/most complex (ie corresponds to the fastest/slowest algorithm) 3) Different types of errors: syntax, logic, etc (you may find reading through prelab 12 and the debugging slides prior to the exam useful) Tips: 1) dont rush, take your time on the exam 2) write out the computations 3) break down questions into smaller pieces you know 4) just like last midterm, question combine 2 or 3 topics into one question Good Luck! Luke

M1 questions: 6,7,9,10,13,16,21 M2 questions: 1,2,4,5,6,8,9,10,11,13,14,15,16,17,18,19,20,23,24