| |
Nov 23, 2024
|
|
|
|
|
CSCE 500 - Design and Analysis of Algorithms 3 Credit Hour(s)
3 Lecture Hour(s) 0 Lab Hour(s)
Basic techniques used in design and analysis of algorithms, including divide-and-conquer, greed methods, dynamic programming, search techniques, backtracking, brand-and-bound, and algebraic transformation. NP-Complete and NP-Hard problems, reductions among and approximations to such problems. Basis concepts surrounding the halting problem.
Prereq: CMPS 341 or CMPS 406
Add to Catalog (opens a new window)
|
|
