Discrete Structures for Computer Science II

• Administrative Handouts
  • Course Syllabus
  • Homework Problems: Part 1
  • Homework Problems: Graph Theory
• Group Work
  • Functions Part 1
  • Functions Part 2
  • Exponentials
  • Friendly functions
  • Logarithms and Big-O
  • Big-O Proof
  • Section 3.3
  • Turing
  • The Towers of Hanoi
  • Recursion and Counting
  • Intro to Graphs
  • Divide and Conquer
  • Graph Isomorphism
  • Graph Isomorphism -- Part II
• Other Handouts
  • Induction Template
  • Recursion Theorems