Mar 29, 2024  
2018-2019 Undergraduate Catalog 
    
2018-2019 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CS 440 - Theory of Algorithms


(3 S.H.)

Concepts and techniques of design efficiency and complexity of algorithms. Topics include principles of algorithm design (divide and conquer, backtracking, dynamic programming, greedy and local search); graph, numerical, pattern matching, and parallel algorithms; P, NP, and NP-complete problems. Prerequisite: ◆ CS 341 - Data Structures . Grade only.


Course Registration



Add to Portfolio (opens a new window)