The following documents outline the notes for the course ICS 161 Design and Analysis of Algorithms. These notes are not for general distribution; they are for use only by students in ICS 161.

Copyright © 2000 and 2002, Michael T. Goodrich, Matthew Dickerson, Roberto Tamassia, and John Wiley and Sons, Inc. All rights reserved.

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

Notes by Weekly Lecture Schedule

• Week 1: Introduction. Growth of functions. Amortization. Data Structures. Heap sort.
  • Algorithm Analysis
  • Elementary Data Structures
  • Heaps and Priority Queues
• Week 2: Search structures. Skip lists. Splay trees.
• Dictionaries and Hash Tables
• Binary Search Trees
• AVL Trees
• Splay Trees
• Skip Lists
• Week 3: Sorting and Selection.
• MergeSort
• QuickSort
• Sets
• Sorting lower bound
• RadixSort
• Selection
• Week 4: Fundamental techniques. The greedy method. Divide-and-conquer.
• The Greedy Method
• Midterm I
  
• Divide-and-Conquer
• Week 5: Dynamic programming. Matrix-chains. Knapsack. Graphs and their representations.
• Dynamic Programming
• Graphs
• Week 6: Graph algorithms. Depth-first search. Biconnectivity. Breadth-first search.
• Depth-first search
• Biconnectivity
• Breadth-first search
• Week 7: Directed graphs. Shortest paths.
• Directed Graphs
• Shortest Paths
(See also some slides about Locators, which were not included in lecture)
• Week 8: Minimum spanning trees. Network flow.
• Minimum Spanning Trees
• Midterm II
• Network Flow
• Week 9: String pattern matching. Tries.
• Memorial Day, May 27, no class
• String Pattern Matching
• Tries
• Week 10: NP-Completeness. Approximation algorithms.
• NP-completeness
• NP-completeness, Part 2
• Approximation Algorithms
• Final Exam: Wednesday, June 12, 2002, 8am-10am.