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, January 7
Wednesday, January 30th

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

Exam 1
Friday, February 1st
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).
Monday, February 4th
Friday, March 1st

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

Exam 2
Monday, March 4th
It will cover [CLRS] Chapters 19, 21, 22,23,24.

Dynamic Programming

Wednesday, March 6th
Monday, April 1st

[CLRS] Chapters 15 and 25.
Exam 3
Wednesday, April 3rd
It will cover [CLRS] Chapters 15 and 25.
NP-completeness, reductions.
Coping with NP-completeness.
Special Topics: Game Theory and Machine Learning.
Friday, April 5th
Friday, April 26th

[CLRS] Chapters 34 and 35.