/lines 33 def
-----
          COS 226 announcements

PROGRAM 5
  Due Thursday
  Writeup due next Monday
No problem set this week

FIRST HALF OF COURSE
  * fundamental algorithms, widely applicable
  * ADT specifications and implementations
      stack, queue, deque
      symbol table
      priority queue
      discrete sets (union-find)
  * understand performance characteristics
  * many implementations for each problem
SECOND HALF OF COURSE
  * domain-specific algorithms
      strings
      geometry
      graphs
      math applications
  * introduction to advanced topics
  * higher level of abstraction
    USE fundamental algorithms
  * performance characteristic more complex
      input hard to characterize
      algorithm dynamics hard to know
      math analysis more difficult
  * more problems than implementations