CPSC 5210 - Design and Analysis of Computer Algorithms

(3) Credit Hours

Algorithm design techniques including divide and conquer, greedy method, dynamic programming, search and traversal, backtracking, branch and bound, graph algorithms. Introduction to the theory of NP-completeness and to methods of coping with NP-complete problems. Introduction to parallel algorithms. Prerequisite: CPSC 5010 or placement, or department head approval. Standard letter grade. Differential Course Fee will be assessed
3.000 Credit hours
3.000 Lecture hours

Levels: Graduate
Schedule Types: Face-to-Face Classroom Instruc, Blended/Hybrid (30-79% Web), Internet (80%> Web Based), Lecture, Video Streaming/Interactive, Web-Enhanced (29%< Web Based)
All Sections for this Course

Computer Science and Engr Department

Course Attributes:
CECS Differential Course Fee, Repeatable Course