Examlets will be taken in-person through CBTF, where you can reserve a 1 hour 50 minute slot during a three-day testing window.

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/26 - 1/29	weeks 1+2	Examlet A
#2: Modular Arithmetic and Sets Relations	2/9 - 2/12	weeks 3+4	Examlet B
#3: Functions Graphs	2/23 - 2/26	weeks 5+6	Examlet C
#4: Two-way bounding Induction Recursive Definition	3/18 - 3/21	weeks 7+8	Examlet D
#5: Trees Grammars Big-O Algorithms Recursion Trees	3/29 - 4/1	weeks 9+10	Examlet E
#6: Algorithms Collections of Sets	4/12-4/15	weeks 11+12	Examlet F
Final	TBD	week 13-15 and induction on inequalities (and also everything else)	Final

 

Academic Integrity Policy

The policies of the CBTF are the policies of this course, and academic integrity infractions related to the CBTF are infractions in this course. The university's guidelines on Academic Integrity can be found here. 

A single cheating offence on an examlet will result in a zero on the examlet in question and lowering your final course grade by a whole letter grade. 

A second cheating offence will typically result in a failing grade.