Book
Lecutres (in HTML format)(audio file link with each lecture)
- Lecture 1 - analyzing algorithms
- Lecture 2 - asymptotic notation
- Lecture 3 - recurrence relations
- Lecture 4 - heapsort
- Lecture 5 - quicksort
- Lecture 6 - linear sorting
- Lecture 7 - elementary data structures
- Lecture 8 - binary trees
- Lecture 9 - catch up
- Lecture 10 - tree restructuring
- Lecture 11 - backtracking
- Lecture 12 - introduction to dynamic programming
- Lecture 13 - dynamic programming applications
- Lecture 14 - data structures for graphs
- Lecture 15 - DFS and BFS
- Lecture 16 - applications of DFS and BFS
- Lecture 17 - minimum spanning trees
- Lecture 18 - shortest path algorthms
- Lecture 19 - satisfiability
- Lecture 20 - integer programming
- Lecture 21 - vertex cover
- Lecture 22 - techniques for proving hardness
- Lecture 23 - approximation algorithms and Cook's theorem
No comments:
Post a Comment