WesMaps - Wesleyan University Catalog 2012-2013       Summer Session       Winter Session       Home       Archive       Search CS92PROD

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: Lecture Grading Mode: Graded Level: UGRD Prerequisites: COMP212 AND MATH228 Fulfills a Requirement for: None SECTION 01 Major Readings: Wesleyan RJ Julia Bookstore To be announced. Examinations and Assignments: To be announced. Instructor(s): Aaron,Eric          Times: ..T.R.. 01:10PM-02:30PM;       Location: SCIE139; Total Enrollment Limit: 30 SR major: 10 JR major: 10     GRAD: 0 SR non-major: 0 JR non-major: 0 SO: 10 FR: 0

Last Updated on JUL-27-2026 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