CSE 5311: Design and Analysis of Algorithms

Lectures

Lecture Topic HTML PostScript PDF
1,2 Introduction to Design and Analysis
3 Recurrences
4 Heapsort and Quicksort
5 Linear Sorting and Order Statistics
6 Hash Tables
7 Binary and Red-Black Trees
8 Augmenting Data Structures
9 B-Trees
10 Dynamic Programming
11,12 Greedy Algorithms
13 Amortized Analysis
14 Mergeable Heaps
15 Disjoint Sets
16 Graph Algorithms
17 Minimum Spanning Trees
18,19 Shortest Paths
20 Maximum Flow
21 Parallel Algorithms
22,23 Number-Theoretic Algorithms and Encryption
24 String Matching
25 Computational Geometry
26 NP-Completeness I
27 NP-Completeness II
28 Approximation Algorithms
29 Conclusions      


Copyright © 1998-2004 The University of Texas at Arlington