A tree with a cycle

Design & Analysis of Efficient Algorithms

Instructor: Eustrat Zhupa
Lecture time: TR 9:40 - 10:55
Classroom: Gavett 206
Course Description
This course covers greedy algorithms, dynamic programming, divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Introduction to NP-completeness and linear programming is also included.
+ Syllabus
See schedule on BB.
+ General Rules