Topics Covered in Algorithms Class

Topics covered in Algorithms class and selective slides from Internet.

Josephus Problem
Heaps and 2-3 trees slides 1 slides 2
Fibonacci Heaps slides animation
Amortized complexity video slides
Union/Find – average and worst case slides 1 slides 2
Sorting and selection slides
Minimum spanning tree algorithms slides 1 slides 2
NP-completeness – definitions, implications, reductions slides
Traveling Salesperson Problem – approximations Christofides Algorithm
Shortest path problems – Dijkstra’s and Floyd’s algorithms slides
Matrix multiplication, Strassen’s algorithm slides
Polynomial multiplication and evaluation;
Fast Fourier Transform
Dynamic programming

MIT open course

Leave a Comment