CSE 3500 Algorithms and Complexity

 

Topics to be covered:

Preliminaries (Chapters 1, 2, 3, 4, 5)

Divide and Conquer, Sorting and Selection (Chapters 4, 6, 7, 8, 9)

Data Structures (Chapters 10, 11, 12, 13, 21)

Dynamic Programming (Chapter 15, 25)

Greedy Algorithms (Chapter 16)

Graph Algorithms (Chapters 22, 23, 24)

Parallel and Randomized Algorithms

Intractable Problems (Chapter 34)