Spring 2013 not offered
|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.
||Gen Ed Area Dept:
|Course Format: Lecture||Grading Mode: Graded|
||Prerequisites: COMP212 AND MATH228
||Fulfills a Major Requirement for: (CIM)(COMP)(IDEA-MN)(MATH)(NS&B)
Cormen, Leiserson, Rivest and Stein, INTRODUCTION TO ALGORITHMS, 3RD EDITION
|Examination and Assignments: |
To be announced.
|Drop/Add Enrollment Requests|
|Total Submitted Requests: 0||1st Ranked: 0||2nd Ranked: 0||3rd Ranked: 0||4th Ranked: 0||Unranked: 0|