COMP 312
Spring 2021
| Section:
01
|
| Crosslisting:
COMP 510 |
| Course Cluster and Certificates: Integrated Design, Engineering & Applied Science Minor |
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): Shai,Saray Times: ..T.R.. 01:00PM-02:20PM; Location: ONLINE; |
| Total Enrollment Limit: 35 | | SR major: 20 | JR major: 15 | | |
| | GRAD: X | SR non-major: X | JR non-major: X | SO: 0 | FR: X |
|