Examlets will be taken in-person at the CBTF. Examlets 1-12 are 50 minutes long; the final is 1 hour and 50 minutes.
Use this link to enroll in our course on PrairieTest so that you can reserve your time for each examlet. Sign up for a CBTF time for each examlet as soon as signups open on PrairieTest. This is usually about 11 days before the examlet window starts. Timeslots may fill up or, more likely, you may discover that your only options are inconvenient (e.g. early morning).
Before the first examlet, familiarize yourself with the basic exam instructions. Only the most critical parts will be explicitly included on the individual exams.
Starting with Examlet 3, you will be required to use LaTeX formatting when writing equations that contain elements (e.g. exponents, summations, math symbols) beyond ordinary plaintext. This is optional for the first two examlets, but we recommend that you get used to using it early, e.g. when typing in your tutorial problems. It is not difficult to learn the basics: 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.
High-level rubrics for the manually-graded examlet questions will be released a day or two before the CBTF window for taking each examlet.
| Examlet | Week Given | CBTF dates (usually Tues-Thurs) |
Skills list | Rubrics |
|---|---|---|---|---|
| #1: Prereqs and Logic | Week 3 | Feb 3-5 | Examlet 1 | rubrics |
| #2: Proofs Number Theory |
Week 4 | Feb 10-12 | Examlet 2 | rubrics |
| #3: Modular Arithmetic Sets |
Week 5 | Feb 17-19 | Examlet 3 | rubrics |
| #4: Functions | Week 6 | Feb 24-26 | Examlet 4 | rubrics |
| #5: Collections of Sets Graphs |
Week 7 | March 3-5 | Examlet 5 | rubrics |
| #6: Two-way Bounding Contradiction |
Week 8 | March 10-12 | Examlet 6 | rubrics |
| #7: Induction | Week 9 | March 24-26 | Examlet 7 | rubrics |
| #8: Recursive Definition | Week 10 | March 31-Apr 2 | Examlet 8 | rubrics |
| #9: Trees Grammars |
Week 11 | Apr 7-9 | Examlet 9 | rubrics |
| #10: Big-O Inequality Proofs |
Week 12 | April 14-16 | Examlet 10 | |
| #11: Code Analysis Recursion Trees |
Week 13 | April 21-23 | Examlet 11 | |
| #12: NP State Diagrams Regular Expressions |
Week 14 | Apr 29-May 1 Notice: Wed-Fri |
Examlet 12 | |
| Final: Countability Review |
Finals week | Thurs May 7 to Wed May 13 |
Final Examlet |