PhD Program in Computer Science, The Graduate Center, City University of New York
Tuesdays 2:00 - 4:00 p.m. - 3 credits - Professor Gabor T. Herman
Text Book: Introduction to Algorithms (Third Edition), T. H. Cormen, C. E.Leiserson, R. L.Rivest, and C. Stein, The MIT Press, Cambridge, MA
Algorithm analysis evaluates time and memory resource requirements of a proposed algorithm as a function of input length. Algorithm design studies techniques for constructing algorithms with minimal resource requirements. This course covers mainly the design and analysis for a number of important and common algorithms, including divide and conquer, randomized algorithms, sorting, hash tables, binary search trees, dynamic programming, greedy algorithms, data structures for disjoint sets, graph algorithms, spanning trees and shortest paths.
There will be thirteen weekly homework assignments; they will determine 65% of the final grade.
There will be a final exam consisting of problems the solution of which should demonstrate the student's understanding of various algorithms; this will be responsible for 35% of the final grade.