CMPS 323 - Design and Analysis of Algorithms |
Analysis, design, and efficiency of algorithms illustrated by a comprehensive exposure to fundamental algorithms and various adopted techniques to solve different types of problems. Analysis of sorting, searching, and other algorithms; designing algorithms using techniques for problem-solving such as greedy methods, divide-and-conquer, backtracking, dynamic programming, and branch-and-bound techniques; complexity of algorithms.
3.000 Credit hours 3.000 Lecture hours Syllabus Available Levels: Undergraduate Schedule Types: Lecture Computer Science & Engineering Department Course Attributes: Engineering Course (TUI) Restrictions: Must be enrolled in one of the following Levels: Undergraduate Prerequisites: Undergraduate level CMPS 303 Minimum Grade of D and Undergraduate level CMPS 205 Minimum Grade of D |
Return to Previous | New Search |