• Recursion
• Equivalencies: Exponents, Logarithms, Factorials
• Some Summations and Induction review
• Induction
  For faster loading broken into:
  
  • Induction1, Induction2, Induction3, and Induction4
• Exercises so far
  Solutions
  • recursion
  • induction
  • recurrance
• Performance Analysis
  more depth
  • Book referenced in class: The Structure of Scientific Revolution by Thomas Kuhn, The University of Chicago Press, 1962, ISBN 0-226-45804-0
• Homework 1 Assignment
• Examples and Review : Omega, Theta and Handout

Two major sources for Data Structure Review notes
1. Basic early stuff from Dr. Abdou Youssef
   The George Washington University, Washington D.C.
2. my 151 notes
• My notes on Chapter 2.
• Exercise 2

• Divide and Conquer

• Knapsack
• review Graphs from my 151 notes.
  Note - same authors of different books so page numbers in these notes may not match page numbers in the 650 book. General graph stuff in our text is page 112-124.
• Minimum Cost Spanning Trees
• Single Source Shortest Path

• Dynamic Programming

• Traversal and Search

• Backtracking and Branch-and-Bound. (MITs constraint satisfaction and backtracking)

• Lower Bound Theory

• History and Introduction
• Reducibility
• NP-Complete reductions
• more NP-Complete reductions
• NP-Hard and Cook proof

Some of these MIT course notes might be interesting