COMP 312
Spring 2014 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. |
|
| 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 |
Major Readings:
Cormen, Leiserson, Rivest and Stein, INTRODUCTION TO ALGORITHMS, 3RD EDITION
ISBN: 978-0262033848
|
Examinations and Assignments:
To be announced. |
|