Final Exam Details

• When and where is the final exam?
  • Saturday, December 14 from 2pm-5pm in the regular lecture classroom, White Lecture Hall room 107 on East Campus.

• What can I bring to the final?
  • Since the exam is open-book and open-notes (though closed-neighbor and closed computer), please bring a pen or pencil and any of your notes from the course.
  • No electronic devices

• What is the format of the exam?
  • half is multiple choice
  • half is problems similar to first two exams and weekly practice problems
  • a notes sheet will be provided similar to the first two exams
  • a little longer than the normal exam, should have plenty of time in the three hour time slot

• Are there any review materials for the final?
  • Since half the exam will be multiple choice, here are some example multiple choice problems and the answers.
  • For the coding problems, the format and topics of the questions will be very similar to the midterms.

• What topics are on the exam?
  • The final exam is comprehensive covering topics from the entire semester.
  • There will be problems requiring a variety of sequences: Lists, Sets, Tuples, and Dictionaries
  • There will be problems with formatted data, that require you to parse and convert strings --- you will not need to read any data directly from a file
  • Loops: analyzing and building complex and nested loops --- you may be asked to analyze list comprehensions, but you will not need to write them from scratch
  • Recursion: analyzing and completing recursive algorithms --- you will not be asked to write a recursive function from scratch
  • Computability: 1 to 3 multiple choice questions will ask about concepts related to the efficiency of certain algorithms and whether or not a program can be written to solve any problem --- you will not be asked to write any code for these questions