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 Discrete Structures Proofwriting Checklist Guide to Induction Induction Proofwriting Checklist Guide to CFGs Guide to Self-Reference Guide to the Lava Diagram Timeline of CS103 Results
Lectures
0. 6/23 Introduction, Set Theory 1. 6/25 Mathematical Proofs 2. 6/27 Indirect Proofs 3. 6/30 Propositional Logic 4. 7/2 First-Order Logic, Part I 5. 7/4 First-Order Logic, Part II 6. 7/7 Functions, Part I 7. 7/9 Functions, Part II 8. 7/11 Graphs, Part I 9. 7/14 Graphs, Part II 10. 7/16 Mathematical Induction, Part I 11. 7/18 Mathematical Induction, Part II 12. 7/21 Finite Automata, Part I 13. 7/23 Finite Automata, Part II 14. 7/28 Regular Expressions 15. 7/30 Nonregular Languages 16. 8/1 Context-Free Languages 17. 8/4 Turing Machines, Part I 18. 8/6 Turing Machines, Part II 19. 8/8 Unsolvable Problems 20. 8/11 Unsolvable Problems II 21. 8/13 Final Review
Problem Sets
Guide to Partners
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
Practice Midterm 1 Practice Midterm 2 Midterm Extra Practice Problems Midterm Solutions Practice Final 1 Practice Final 2 Final Extra Practice Problems Final 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.