The following documents outline the notes for the course CS 260P.

Note: All the notes are in PDF format. Viewing these files requires the use of a PDF Reader.

Notes by Lecture Schedule

• 1: Introduction. Growth of functions. Basic data structures. Reading: Goodrich-Tamassia, Chapters 1-7, with emphasis on Chapter 1.
  • Algorithm Analysis
  • AVL Trees
  • Heaps
  • Hash Tables
  • Union-Find Structures
• 2: Sorting and Selection. Reading: Goodrich-Tamassia, Chapters 8-9.
• MergeSort
• QuickSort
• Insertion sort and Shell sort (Powerpoint)
• Wikipedia article on Shellsort
• Sorting lower bound
• RadixSort
• Selection
• Random Number Generators (Powerpoint)
• 3: Fundamental techniques. The greedy method. Divide-and-conquer. Reading: Goodrich-Tamassia, Chapters 10-11.
• Random Permutations (Powerpoint)
• The Greedy Method
• Bin Packing (Powerpoint)
• Optional reading: Approximation Algorithms for Bin Packing
• Divide-and-Conquer
• 4: Dynamic programming. Reading: Goodrich-Tamassia, Chapter 12.
• Midterm I
  
• Dynamic Programming
• Telescope Scheduling
• Game Strategies
• 5: Dynamic programming and Graphs. Reading: Goodrich-Tamassia, Chapter 13.
• Longest Common Subsequences
• 0/1 Knapsack
• Graphs
• Network Algorithms: Introduction (Powerpoint)
• Depth-first search
• 6: Graph algorithms. Reading: Goodrich-Tamassia, Chapters 13-14.
  • Breadth-first search
  • Directed Graphs
  • Biconnectivity
  • Biconnected components
  • Shortest Paths
• 7: More graph algorithms. Reading: Goodrich-Tamassia, Chapters 15-16.
• Midterm II
  
• Minimum Spanning Trees
• Network Flow
• 8: NP-Completeness. Reading: Goodrich-Tamassia, Chapter 17.
• NP-completeness, Powerpoint
• Satisfiability, Powerpoint
• NP-complete Reductions, Powerpoint
• 9: More NP-completeness and approximation algorithms. Reading: Goodrich-Tamassia, Chapters 17-18.
• More NP-complete Reductions, Powerpoint
• Approximation Algorithms
• 10: Randomized Algorithms and the Stable Marriage Problem. Reading: Goodrich-Tamassia, Chapter 19.
• Randomized Algorithms
• The Stable Marriage Problem
• Skip Lists
• Final exam