Course
Syllabus Honor Code How to Succeed in CS103 Office Hours How to Improve
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 Subset Construction Guide to Regular Expressions Guide to State Elimination 🌱(ish) Guide to the Myhill-Nerode Theorem 🌱 Guide to CFGs
Lectures
0. 1/5 Introduction, Set Theory 1. 1/7 Mathematical Proofs 2. 1/9 Indirect Proofs 3. 1/12 Propositional Logic 4. 1/14 First-Order Logic, Part I 5. 1/16 First-Order Logic, Part II 6. 1/21 Functions, Part I 7. 1/23 Functions, Part II 8. 1/26 Set Theory Revisited 9. 1/28 Graphs, Part I 10. 1/30 Graphs, Part II 11. 2/2 Graphs, Part III 12. 2/4 Mathematical Induction, Part I 13. 2/6 Mathematical Induction, Part II 14. 2/9 Finite Automata, Part I 15. 2/11 Finite Automata, Part II 16. 2/13 Finite Automata, Part III 17. 2/18 Regular Expressions 18. 2/20 Nonregular Languages 19. 2/23 Context-Free Languages
Problem Sets
🌟 Study Group Bonus Guide to Partners Request an Extension Regret Clause Form
0. Problem Set 0 1. Problem Set 1 2. Problem Set 2 3. Problem Set 3 4. Problem Set 4 5. Problem Set 5 6. Problem Set 6 7. Problem Set 7
Exams
Exam Logistics
Extra Practice Problems 1 🌱 Midterm Exam Solutions
📅 Schedule

Guide to Elements and Subsets

(If not redirected, click here)

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