Sep 22, 2020  
2019-2020 Catalog 
    
2019-2020 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CSCI 405 - Analysis of Algorithms and Data Structures II


Derivation of time and space complexity of algorithms. Typical algorithms investigated include minimum spanning tree, shortest path, network flow and string matching. Advanced treatment of dynamic programming, greedy algorithms and randomized algorithms. Discussion of NP-Completeness. Correctness proofs of algorithms.

Prerequisites & Notes: CSCI 305
Credits: 4
Grade Mode: Letter



Add to Portfolio (opens a new window)