COMPUTER SCIENCE 430

Edward M. Reingold reingold@iit.edu


Miscellaneous Handouts

  • General Information
  • Reading Assignments

    Lecture Notes

  • Lecture 1: January 9 (How to draw a tree)
  • Lecture 2: January 11 (Review of CS 330 on recurrences; revised)
        Quiz section 1: January 13 (Review of big-oh notation; recurrences)
  • Lecture 3: January 18 (Insertion sort and heap sort)     Insertion sort demo     Heapsort animation
        Quiz section 1: January 20 (More details on Insertion Sort and Heapsort; review of HW 1 solutions)
  • Lecture 4: January 23 (Quicksort)     Quicksort animation
  • Lecture 5: January 25 (More on quicksort, mergesort, selection)
        Quiz section 3: January 27 (Linear time sorting)
  • Lecture 6: January 30 (Lower bounds on sorting)     Sorting decision trees
  • Lecture 7: February 1 (Binary search trees)
        Quiz section 4: February 3 (Review of random binary search tree growth)
  • Lecture 8: February 6 (Red-black trees)     Red-black tree demo
        Quiz section 5: February 10 (First exam solutions)

    Homework

  • Honesty pledge (sign and submit with first homework)
  • Homework Assignment 1 (due January 18)   Solutions
  • Homework Assignment 2 (due February 1)   Solutions (corrected)
  • Homework Assignment 3 (due February 15)

    Sample Exams

  • Sample First Exam   Solutions

    Exams

  • First Exam (February 8) Solutions