WesMaps - Wesleyan University Catalog 2012-2013       Home       Archive       Search
Algorithms and Complexity

COMP 312
Fall 2012
Section: 01  
Crosslisting: COMP 510
Certificates: Informatics and Modeling

The course will cover the design and analysis of efficient algorithms. Basic topics will include greedy algorithms, divide-and-conquer algorithms, dynamic programming, and graph algorithms. Some advanced topics in algorithms may be selected from other areas of computer science.
Credit: 1 Gen Ed Area Dept: NSM MATH
Course Format: LectureGrading Mode: Graded
Level: UGRD Prerequisites: COMP212 AND MATH228
Fulfills a Major Requirement for: (COMP)(MATH)(MECO)
Past Enrollment Probability: 90% or above

Last Updated on APR-18-2014
Contact wesmaps@wesleyan.edu to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email ? Wesleyan University, Middletown, Connecticut, 06459