Weekly examlets start in the third week of classes. Most of the examlets will be taken in-person through CBTF (you will receive instructions), where you can resreve a 50 minute slot in Sunday, Monday, or Tuesday of that week. We plan to have a fake non-graded examlet during the second week so that you can make yourself familiar with the process.
Before the first examlet, you must read the exam instructions. These instructions will NOT be reprinted with each examlet.
When writing equations in PrairieLearn, it's often helpful to know some basic latex commands. Here is a brief guide
The listed chapters and skills are the new skills for each examlet. The examlet will focus on these new skills. However, be aware that you're still expected to remember concepts from earlier in the term.
The information (e.g. skills list, study problem) for each examlet should be viewed as tentative until a week before the examlet date. We don't expect large changes but there might be small ones.
| Examlet | Week Given | Review lectures/readings/problems from: | Skills list |
|---|---|---|---|
| #1: Prereqs and Logic | week 3 | week 1 | Examlet 1 |
| #2: Number Theory | week 4 | week 2 | Examlet 2 |
| #3: Modular Arithmetic and Sets | week 5 | week 3 | Examlet 3 |
| #4: Relations | week 6 | week 4 | Examlet 4 |
| #5: Functions | week 7 | week 5 | Examlet 5 |
| #6: Graphs | week 8 | week 6 | Examlet 6 |
| #7: Two-way bounding Easier Induction |
week 9 | week 7 (and 2-way bounding from week 6) | Examlet 7 |
| #8: Induction Recursive Definition |
week 10 | week 8 | Examlet 8 |
| #9: Trees Grammars |
week 11 | week 9 (and regular expressions from Chapter 1.6) | Examlet 9 |
| #10: Big-O Algorithms Recursion Trees |
week 12 | week 10 | Examlet 10 |
| (no examlet) | week 13 | ||
| #last: Algorithms NP Collections of Sets |
week 14 | week 11/12 | Examlet "last" |
| Final | finals week | weeks 13/14 and induction on inequalities (and to a lesser extent, everything else) |
Final |