Discrete Structures for Computer Science II

• Administrative Handouts
  • Course Syllabus
  • Homework Problems for Spring 2026
• Group Work
  • Definition of Big-O
  • Proving that f is NOT O(g)
  • The Traveling Salesman Problem
  • The Towers of Hanoi
  • Induction Practice
  • Recursion Practice
  • Recursion and Reading Part I
  • Recursion and Reading Part II
  • Divide and Conquer
  • Equivalence Relations
  • Graph Isomorphism
  • Graph Isomorphism -- Part II
• Other Handouts
  • Induction Template
  • P and NP
  • Recursion Theorems