COMP 312
Fall 2009
| 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. |
|
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: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: COMP212 AND MATH228 |
|
Fulfills a Requirement for: (COMP)(IDEA-MN)(IDEA-EE)(INFO-MN)(MATH)(NS&B)(STS) |
|
Past Enrollment Probability: Not Available |
|
|