Approximate Schedule for CS 3510 -- Design and Analysis of Algorithms

[Main Page]

Introduction to running times and the analysis of algorithms.

Divide and conquer algorithms.
Probabilistic Analysis and Randomized Algorithms.
Monday, August 20
Friday, September 21st

[CLRS] Chapters 2,3, 4, 5 and 7.

Exam 1
Monday, September 24th
It will cover [CLRS] Chapter 2,3, 4.
Graph algorithms:
DFS, topological sorting, strongly connected components
BFS, Shortest paths and Dijkstra's Algorithm, Min-Heaps
Minimum Spanning Trees (MST).
Wednesday, September 26th
Friday, October 19th

[CLRS] Chapters 19,21,22,23,24.

Exam 2
Monday, October 22nd
It will cover [CLRS] Chapters 19, 21, 22,23,24.

Dynamic Programming

Wednesday, October 24th
Wednesday, Novermber 14th

[CLRS] Chapters 15 and 25.
Exam 3
Friday, November 16th
It will cover [CLRS] Chapters 15 and 25.
NP-completeness, reductions.
Coping with NP-completeness.
Special Topics: Game Theory and Machine Learning.
Monday, November 19th
Friday, December 7th

[CLRS] Chapters 34 and 35.