|
|
|
|
 |
|
 |
 |
 |
| |
Courses
CATALOG DESCRIPTIONS
Back to Previous Page 
CS 3414 Design and Analysis of Algorithms
Description:
This course covers the fundamental principles of the design and analysis of algorithms. Topics include asymptotic notation, recurrences, randomized algorithms, sorting and selection, balanced binary search trees, augmented data structures, advanced data structures, algorithms on strings, graph algorithms, geometric algorithms, greedy algorithms, dynamic programming, and NP completeness.
Credits: 4:0:0:4
Pre-Requisite: CS 2134 (C- or better) and MA 2312/2322
Co-Requisite: none
Notes: none
|
|
|
 |
 |
 |
|
| | |  |
|
