a
CS 5633: Analysis of Algorithms
# CS 5633: Analysis of Algorithms

## Syllabus and Assignments

Syllabus
(Latex for this document)
Problem Set 1
(Latex for this document),
Problem Set 2
(Latex for this document),
Problem Set 3
(Latex for this document).

Project
(Latex for this document).

Sample Exam Questions.

Problem Set 4
(Latex for this document),
Problem Set 5
(Latex for this document),
Problem Set 6
(Latex for this document).

Sample Final Questions.

## Notes

Foundations:
Divide and Conquer Algorithms
(slides),
Order Notation
(slides),
Recurrences
(slides),
Probabilistic Analysis
(slides).
Sorting and Order Statistics:
Heapsort
(slides),
Quicksort
(slides),
Quicksort Recurrences,
Linear Sorting
(slides),
Order Statistics
(slides),
Sorting Summary
(slides).

Data Structures:
Dynamic Sets and Elementary Data
Structures
(slides),
Hash Tables
(slides),
Binary Search Trees
(slides),
Red-Black Trees
(slides)

Advanced Design and Analysis Techniques:
B-Trees
(slides),
Dynamic Programming
(slides),
DP for Subset-Sum and Knapsack,
Greedy Algorithms
(slides),
Amortized Analysis
(slides),
Disjoint Sets
(slides).

Graph Algorithms:
Elementary
Graph Algorithms
(slides),
Minimum
Spanning Trees
(slides),
Shortest Paths
(slides),
Maximum Flow
(slides).

Selected Topics:
String Matching
(slides),
NP-Completeness
(slides),
Diagram of P and NP Set Relationships.

## Other Stuff

Back to Tom Bylander's Home Page