Examlets will be taken in-person at the CBTF. Examlets 1-7 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.

Before the first examlet, you must read the exam instructions. These instructions will NOT be reprinted with each examlet.

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	CBTF dates	Review lectures/readings/problems from:	Skills list	Rubrics
#1: Prereqs and Logic Number Theory	Feb 3-5	weeks 1+2	Examlet 1	Examlet 1
#2: Modular Arithmetic and Sets Collections of Sets	Feb 17-19	weeks 3+4	Examlet 2	Examlet 2
#3: Functions Graphs Two-way bounding	March 3-5	weeks 5+6	Examlet 3	Examlet 3
#4: Induction Recursive Definition	March 24-26	weeks 7+8	Examlet 4	Examlet 4
#5: Trees Grammars Big-O and simple algorithms	April 7-9	weeks 9+10	Examlet 5	Examlet 5
#6: Recursion Trees Code analysis NP	April 21-23	weeks 11+12	Examlet 6	Examlet 6
#7: Contradiction State Diagrams Countability	May 5-7	weeks 13+14	Examlet 7	Examlet 7
Final	Thurs May 8       to Wed May 14	weeks 1 to 14	Final Examlet	Final Examlet