Exam Review
Today we discussed Monday's exam, the priorities, and how the exam might look. We discussed why we'll be testing what we'll be testing and how. If you missed class, you missed the discussion and Q&A, but here is the bumper sticker about the exam:
- Define an exception, as well as distinguish types and handle differently.
- Simple data structure question (list, tuple, set, dictionary)
- Nested data structure question (maybe building on simple)
- Define a generator, instantiate and use it.
- Define a co-routine, instantiate and use it.
- Pipeline generator or coroutine (roll dice, not time to ask both)
- Generator expression or list comprehension (similar, roll dice, not time to ask both)
- Lambda (quickie, but only if there is time)
Contemplated, but not on the exam (still fair game for final):
- Recursive problem solving (next test, you are still doing the lab)
- String functions, formatting strings (important, but too little time to be more than a dice roll)
- Command-line arguments (don't think people will lose many points here, nto worth the limited time during an exam)
- I/O (important, but just not enough time, keep focus on problem solving)