CSCI 405 - Analysis of Algorithms and Data Structures II

Description
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.
Credits
4
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2019, Spring 2019, Fall 2018, Spring 2018, Fall 2017
Offered
MTuWF
Avg. Class Size
35
Avg. Sections
1