Ananya's CS173 notes and examlet problem reviews. The lack of CSS on this page is entirely intentional.
Section Notes
Chapter 1: Math Review
Chapter 2: Logic
Chapter 3: Proofs
Chapter 4: Number Theory
Chapter 5: Sets
Chapter 6: Relations
Chapter 7: Functions and onto
Chapter 8: Functions and one-to-one
Chapter 9: Graphs
Chapter 10: 2-way Bounding
Chapter 11: Induction
Chapter 12: Recursive Definition
Chapter 13: Trees
Chapter 14: Big-O
Chapter 15: Algorithms
Chapter 16: NP
Chapter 17: Proof by Contradiction
Chapter 18: Collections of Sets
Chapter 19: State Diagrams
Chapter 20: Countability
Chapter 21: Planar Graphs
Examlets
#1: Prerequisites and Logic
#2: Number theory
#3: Set theory (and modular arithmetic)
#4: Relations
#5: Functions
#6: Graphs
#7: Two-way bounding, Easy Induction
#8: Induction, Recursive Definition
#9: Trees, Grammars
#10: Big-O, Recursion Trees
#11: Algorithms, NP
#12: Contradiction, Collections of Sets
Final: State Diagrams, Countability