The following documents outline the notes for the course CS 161 Design and Analysis of Algorithms.

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. Amortization. Data Structures. Heap sort.
  • Algorithm Analysis
  • Elementary Data Structures
  • Priority Queues
  • Heaps
• 2: Dictionaries.
• Dictionaries
• Hash Tables
• Cuckoo Hashing
• 3: Binary Search Trees and Sorting.
• Binary Search Trees
• AVL Trees
• Rank-Balanced Trees
• Splay Trees
• Skip Lists
• MergeSort
• QuickSort
• Sets
• Sorting lower bound
• RadixSort
• Selection
• 4: Fundamental techniques. The greedy method. Divide-and-conquer.
• The Greedy Method
• Midterm I
  
• Divide-and-Conquer
• 5: Dynamic programming. Matrix-chains. Knapsack. LCS. Graphs and their representations.
• Dynamic Programming
• Longest Common Subsequence problem
• Maximum Subarray Problem
• Graphs
• 6: Graph algorithms. Depth-first search. Breadth-first search.
• Depth-first search
• Breadth-first search
• Directed Graphs
• 7: Shortest paths, Minimum Spanning Trees.
• Shortest Paths
(See also some slides about Locators, which were not included in lecture)
• Minimum Spanning Trees
• 8: Network flow.
• Network Flow
• 9: NP-Completeness. Approximation algorithms.
• NP-completeness
• NP-completeness, Part 2
• Approximation Algorithms
• 10: Crypto and Computational Geometry.
• Cryptography
• Numerical Algorithms
• The RSA Cryptosystem
• Information Security
• Convex Hulls