Final Exam Details
- When and where is the final exam?
- Wednesday, April 30 from 2pm-5pm in the regular lecture
classroom, LSRC room B101
- 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
- All written, no online part
- Are there any review materials for the final?
- 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
- 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
- Hangman: 1 to 3 multiple choice questions and 1 coding question will be asked relating to how the code works and how to complete the given code
