COMP 312
Spring 2025
| Section:
01
|
| Crosslisting:
COMP 510 |
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: Student Option |
| Level: UGRD |
Prerequisites: COMP212 AND MATH228 |
|
Fulfills a Requirement for: None |
| SECTION 01 |
| Instructor(s): Krizanc,Daniel Times: ..T.R.. 08:50AM-10:10AM; Location: SCIE109; |
| Total Enrollment Limit: 27 | | SR major: 15 | JR major: 10 | | |
| | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 2 | FR: 0 |
|