Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 4810 - Advanced Algorithms
Builds on CS 3000. Presents an advanced study of computer algorithms. Covers basic algorithmic paradigms (e.g., greedy, divide-and-conquer, and dynamic programming); graph algorithms; optimization; computational Intractability (e.g., NP-completeness, PSPACE-completeness); randomized algorithms; and approximation algorithms. 4.000 Credit hours 4.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: Computer&Info Sci Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CS 3000 Minimum Grade of D-

CS 4810 - Advanced Algorithms

Builds on CS 3000. Presents an advanced study of computer algorithms. Covers basic algorithmic paradigms (e.g., greedy, divide-and-conquer, and dynamic programming); graph algorithms; optimization; computational Intractability (e.g., NP-completeness, PSPACE-completeness);
randomized algorithms; and approximation algorithms.
4.000 Credit hours
4.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture

Computer Science Department

Course Attributes:
Computer&Info Sci

Restrictions:
Must be enrolled in one of the following Levels:
Undergraduate

Prerequisites:
Undergraduate level CS 3000 Minimum Grade of D-

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

SCT WWW Information System

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.