CS 13 (Fall 2023)

Welcome to CS 13! We’re super excited to have you here this term!


Due Next


Wellness and Inclusion

It is very important to us that you succeed in CS 13. We provide many extra resources to help you. Adam and the TAs hold many office hours, and we have a discussion board where you can ask questions asynchronously.

It is also very important to us that you maintain your mental wellness throughout the course. A few points are not worth losing sleep over. Everyone on the course staff is available to chat, and you can always attend office hours for a non-academic conversation if necessary. You can also visit the counseling center if you find you need help beyond the course staff. If you have a temporary health condition or permanent disability (either mental health or physical health related), you should contact accessibility services if you have not already. Additionally, if there is something we can do to make your experience better, please let us know.

Diversity, inclusion, and belonging are all core values of this course. All participants in this course must be treated with respect by other members of the community in accordance with the honor code. If you feel unwelcome or unsafe in any way, no matter how minor, we encourage you to talk to Adam or one of the Deans. We view these sorts of honor code violations as completely unacceptable, and we take them very seriously.


Ed Discussion

Course Staff


Book an appointment!
Annenberg 115
(626) 395-1765

Teaching Assistants

Nico Adamo
Yakov Shalunov
Winter Pearson
Lark Mendoza
Sreemanti Dey
Sahil Azad
Zachary Huang
Mario Solis


The following is a list of handouts that you might find helpful throughout the course. We’ve categorized them by when they are useful.


Syllabus – an overview of the course and administrative information

Collaboration Policy – the course collaboration policy

HowToLaTeX – a handout to help with typesetting various things in LaTeX


The Proof is in the Pudding – an overview of how proofs are supposed to be written

Definitions and Theorems – a complete listing of definitions and theorems you may use without proof

Proof Technique Templates – technique templates for how to write various types of proofs

Set Notation – a reference on what all the set definitions are for use in proofs


Introduction to Verifications – a description of what a verification is with some examples


L00 Wed, Sep 27 Intro and Review [ pdf ]
L01 Fri, Sep 29 Induction and Strong Induction [ pdf ]
Lecturcises00 (review and induction) due @ 11:30 pm on Fri, Sep 29
L02 Mon, Oct 02 Number Representation [ pdf ]
L03 Wed, Oct 04 Cancelled
L04 Fri, Oct 06 Number Theory I: Modular Arithmetic [ pdf ]
Lecturcises01 (number theory) due @ 11:30 pm on Sat, Oct 07
L05 Mon, Oct 09 Number Theory II: Euclidian Algorithm [ pdf ]
Written00 (induction and number theory) due @ 11:30 pm on Mon, Oct 09
L06 Wed, Oct 11 Practice: Number Theory Proofs [ pdf ]
L07 Fri, Oct 13 Application: RSA [ pdf ]
Lecturcises02 (number theory) due @ 11:30 pm on Sat, Oct 14
L08 Mon, Oct 16 Euler's Theorem and Structural Induction [ pdf ]
Written01 (number theory) due @ 11:30 pm on Mon, Oct 16
L09 Wed, Oct 18 Structural Induction and BSTs [ pdf ]
L10 Fri, Oct 20 Combinatorics I: Introduction
Lecturcises03 (structural induction) due @ 11:30 pm on Sat, Oct 21
L11 Mon, Oct 23 Combinatorics II: Fancy Counting
Application00 (cryptography) due @ 11:30 pm on Mon, Oct 23
L12 Wed, Oct 25 Application: Compression
L13 Fri, Oct 27 Probability I: Equally-Likely Outcomes
Lecturcises04 (inclusion exclusion) due @ 11:30 pm on Sat, Oct 28
L14 Mon, Oct 30 Probability II: Conditional Probability
Written02 (structural induction) due @ 11:30 pm on Mon, Oct 30
L15 Wed, Nov 01 Probability III: Independence
L16 Fri, Nov 03 Probability IV: Random Variables and Expectation
Lecturcises05 (independence) due @ 11:30 pm on Sat, Nov 04
L17 Mon, Nov 06 Practice: Combinatorics and Probability
Application01 (compression) due @ 11:30 pm on Mon, Nov 06
L18 Wed, Nov 08 Graphs I: Definitions & Trees
L19 Fri, Nov 10 Graphs II: Graph Induction
Lecturcises06 (expectation) due @ 11:30 pm on Sat, Nov 11
L20 Mon, Nov 13 Graphs III: Graph Algorithms
L21 Wed, Nov 15 Practice: Graphs
L22 Fri, Nov 17 Application: TBD
Lecturcises07 (graphs) due @ 11:30 pm on Sat, Nov 18
Application02 (classification) due @ 11:30 pm on Sun, Nov 19
L23 Mon, Nov 20 ECC I: Polynomials
L24 Wed, Nov 22 ECC II: Lagrange Interpolation
:( Fri, Nov 24 Thanksgiving: No Class!
L25 Mon, Nov 27 ECC III: Fields and GF(256)
L26 Wed, Nov 29 ECC IV: Basic Reed-Solomon Codes
L27 Fri, Dec 01 Application: QR Codes
Written03 (probability and graphs) due @ 11:30 pm on Mon, Dec 04