COMP 312
Fall 2025
| Section:
01
02
|
| 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 |
|
Past Enrollment Probability: 75% - 89% |
| SECTION 01 |
| Instructor(s): Krizanc,Daniel Times: ..T.R.. 08:50AM-10:10AM; Location: SCIE141; |
| Total Enrollment Limit: 25 | | SR major: 15 | JR major: 8 | | |
| Seats Available: 0 | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 2 | FR: 0 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 1 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 1 |
| SECTION 02 |
| Instructor(s): Krizanc,Daniel Times: ..T.R.. 10:20AM-11:40AM; Location: SCIE141; |
| Total Enrollment Limit: 25 | | SR major: 15 | JR major: 8 | | |
| Seats Available: -1 | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 2 | FR: 0 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 4 | 1st Ranked: 2 | 2nd Ranked: 2 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|