A Posteriori Syllabus

This page will contain a stack of the day-by-day outline of what actually transpired in class.

• Fri 5/18
  AVL trees
  Take-out exam
• Wed 5/16
  Homework Answers
  Infix -> Postfix
• Mon 5/14
  Tree traversals
  Examples applications of each
  universal iterative traversal, see tree3.cpp
  zoo.cpp
• Fri 5/11-
  Tree insertion
  Tree search
• Wed 5/9-
  Hash functions
  Collision resolution
• Mon 5/7-
  Sequential Search
  Binary Search
  Hashing
• Fri 5/4-
  index functions
  Radix Sort
• Wed 5/2-
  QuickSort (see qsort.cpp)
  Heaps ADT
  HeapSort (see heapsort.cpp)
• Mon 4/30-
  midterm break
• Fri 4/27-
  Comparison of Sorts
  Intuitive sorts: Exchange, Selection, Insertion
  List Insertion
  O(n^2) time
  MergeSort
  O(n lg n) time
• Wed 4/25-
  midterm exam
• Mon 4/23-
  Review for Quiz I
  see old Quiz 1 from '98
• Fri 4/20-
  Lab on solid graphics
  g2 - shapes - pizza parts
  (see pizza.cpp)
• Mon 4/23-
  Review for Quiz I
  see old Quiz 1 from '98
• Fri 4/20-
  Lab on solid graphics
  g2 - shapes - pizza parts
  (see pizza.cpp)
• Mon 4/23-
  Review for Quiz I
  see old Quiz 1 from '98
• Fri 4/20-
  Lab on solid graphics
  g2 - shapes - pizza parts
  (see pizza.cpp)
• Wed 4/18-
  Strings
  characters
  fixed size array implementation
  null terminated strings
  string using pointers (see Pstrings0.cpp)
• Mon 4/16-
  Recursion
  Fibonacci numbers (see fibtrace.cpp)
  GCD (see gcdtrace.cpp)
  SnowFlake curve (see SnowFlake.cpp)
• Fri 4/13-
  Two-way linked lists
  see Twink1.cpp
  Using only one "link"
  see Twink.2.cpp
• Wed 4/11-
  Inheritance
  Ex. deriving a stack from a queue
  see SQ.cpp
• Mon 4/9-
  Queues - uses, ADT
  array implementation
  beginning of linked list implementation
• Fri 4/6-
  Workshop
  Stack using linked list
  Complete Pop and ~Stack
  (see stack31.cpp)
  Template it
  stack.h file
• Wed 4/4-
  Stack using array (top=top v. top = next)
  Stack to simulate recursion
  (see Fibstack.cpp)
  Review of pointers
  stack implementation using pointers
  (modifications to stack11.cpp)

• Mon 4/2-
  Stacks
  Motivation: function calls, evaluation of expressions
  Stack ADT
  Implementation using arrays
  structs, classes, templates
  see stack*.cpp

• Fri 3/30-
  Ex: Knight class
  rat5.cpp

• Wed 3/28-
  ADTs
  Ex: A Safe Array Class
  more on rats

• Mon 3/26- <
  Overview of the course
  Example: rats!