| |
May 09, 2025
|
|
|
|
|
CSCI 461 - Analysis of Algorithms
Algorithm design and analysis is fundamental in computer science. This course provides an introduction to algorithm design and techniques for analyzing time and space efficiency of algorithms. Some algorithm design techniques include divide-and-conquer, greedy algorithms, dynamic programming, randomized algorithms, and parallel algorithms. The algorithm analysis will examine computational models, different case analyses (best, average, worst), and computational complexity (i.e., NP-completeness).
Prerequisites
CSCI-361 and MTHS-371 with minimum grade of C-
Credit Hours: 3
Add to Portfolio (opens a new window)
|
|
