WesMaps - Wesleyan University Catalog 2019-2020       Summer Session       Winter Session       Home       Archive       Search
CS92PROD
Algorithms and Complexity


COMP 312
Fall 2019 not offered
Crosslisting: COMP 510
Certificates: Informatics and Modeling
Course Cluster: Integrated Design, Engineering & Applied Science Minor

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: (CIM)(COMP)(IDEA-MN)(MATH)(NS&B)

Last Updated on NOV-15-2019
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