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 Regular Expressions
Guide to State Elimination
Guide to the Subset Construction
Guide to CFGs
Guide to the Myhill-Nerode Theorem
Guide to Self-Reference
Guide to Cantor's Theorem
Guide to the Lava Diagram
Timeline of CS103 Results
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)
8. 7/23 Finite Automata
9. 7/28 More Finite Automata and Regular Expressions
10. 7/30 Converting NFAs to Regular Expressions
11. 8/4 CFGs and Intro to Turing Machines
12. 8/6 Turing Machines and R vs RE
13. 8/11 Decidability and The Halting Problem
14. 8/13 P vs NP and Complexity Theory
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 Midterms
Practice Finals
đŸ—“Schedule
Guide to Elements and Subsets
(If not redirected, click
here
)