Lecture 3: Recurrences/Stacks/Queues

This lecture was based on pages 7 through 10 (panels 36 though 56) of Lecture 2.
Additionally these slides were used to cover stacks and queues.

Lecture 9: Binary Search Trees I

Binary Search Trees I (PDF) (TXT)

Lecture 8: Dynamic Programming III

Dynamic Programming III

Lecture 7: Dynamic Programming II

Dynamic Programming II

Homework 3 : Part A

Here is part A of the dynamic programming homework. This is due at 12:00 NOON (at the beginning of lecture) on Tuesday, February 19. You may not use late days for this part of the homework and you must print out this worksheet and work on it.
Handout

Office hour changed

I'm changing my office hour permanently from Thursday to Tuesday, 7:00 - 8:00, starting from this week. So the next office hour will be on Feb 5th, at WeH 8th floor couch. There will be no change after this. I am sorry for any confusion.

Clarification of Snake Theory Question 2

One of the theory questions for snake says "State a tight Big-Oh bound for..." Please be sure to also explain your answer.