WesMaps - Wesleyan University Catalog 2010-2011       Summer Session       Winter Session       Home       Archive       Search
Algorithms and Complexity

COMP 312
Fall 2010 not offered
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.

Essential Capabilities: Logical Reasoning, Quantitative Reasoning
This course will focus on the creation of specific and general computational models and will train students in the mastery of their concrete and formal descriptions.
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)(IDEA-MN)(INFO-MN)(MATH)(NS&B)

Last Updated on JUL-13-2020
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