Examlets will be taken in-person through CBTF, where you can reserve a 1 hour 50 minute slot for Saturday, Sunday, or Monday.

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

LaTeX is not required for formatting math as long as your plaintext is understandable, but it is very useful and 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.

Examlet	CBTF dates	Review lectures/readings/problems from:	Skills list
#1: Prereqs and Logic Number Theory	1/28 - 1/30	weeks 1+2	Examlet A
#2: Modular Arithmetic and Sets Relations	2/11 - 2/13	weeks 3+4	Examlet B
#3: Functions Graphs	2/25 - 2/27	weeks 5+6	Examlet C
#4: Two-way bounding Induction Recursive Definition	3/20 - 3/22	weeks 7+8	Examlet D
#5: Trees Grammars Big-O Algorithms Recursion Trees	4/1 - 4/3	weeks 9+10	Examlet E
#6: NP Algorithms Collections of Sets	4/15 - 4/17	weeks 11+12	Examlet F
Final	5/4 - 5/9	week 13-15 and induction on inequalities (and also everything else)	Final