CS103

Course
Syllabus Honor Code How to Succeed in CS103 Office Hours
Resources
Mathematical Prerequisites Guide to Elements and Subsets Guide to Proofs Guide to $\LaTeX$ Proofwriting Checklist Guide to Negation Guide to Logic Translations Logic Translation Checklist Guide to Proofs on Discrete Structures Guide to Proofs on Sets Discrete Structures Proofwriting Checklist Guide to Induction Induction Proofwriting Checklist Guide to the Lava Diagram
Lectures
0. 6/23 Set Theory and Introduction to Proofs 1. 6/25 More Applications of Proofs, plus Negations 2. 6/30 Propositional Logic and Existential & Universal Quantifiers 3. 7/2 More Propositional Logic and Functions 4. 7/7 Functions and Graphs 5. 7/9 Proofs about Graphs and Pigeonhole Principle 6. 7/14 Induction Part 1 (plus live midterm review) 7. 7/16 Induction Part 2 (plus live midterm review)
Problem Sets
Guide to Partners
0. Problem Set 0 1. Problem Set 1 2. Problem Set 2 3. Problem Set 3
Exams
Exam Logistics
Practice Midterms
🗓Schedule

P vs NP and Complexity Theory

Thursday August 13

File Attachments

Lecture Slides.pdf

Lecture Recording

The complete archive of this quarter's lecture recordings is available on Canvas.

All course materials © Stanford University 2025.
Website programming by Julie Zelenski with minor edits by Keith Schwarz and Sean Szumlanski. This page last updated 2026-Jul-08.