Computer Science 611 - Advanced Algorithms

The design and analysis of efficient algorithms for important computational problems. Paradigms for algorithm design including Divide and Conquer, Greedy Algorithms, Dynamic Programming; and, the use of Randomness in Algorithms. Algorithms for Sorting and Searching, Graph Algorithms, Matroid, Linear Programming, Proving NP completeness, Approximation Algorithms for NP Complete Problems, and others. Prerequisites: The mathematical maturity expected of incoming Computer Science graduate students, knowledge of algorithms at the level of COMPSCI 311.

Open to graduate Computer Science students only. MATHEMATICAL MATURITY WITH KNOWLEDGE OF ALGORITHMS AT THE LEVEL OF COMPSCI 311 EXPECTED OF INCOMING CS GRADUATE STUDENTS. INSTRUCTOR PERMISSION REQUIRED FOR UNDERGRADUATE CS MAJORS CLEARED BY THE UPD, IF AVAILABLE SEATS. SEATS HELD FOR INCOMING GRAD STUDENT REGISTRATION. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/academics/course-overrides.