|
Jan 15, 2025
|
|
|
|
CS 7353 Analysis of Algorithms(3 hours) Design and analysis of efficient algorithms. Design techniques including recursion, divide-and- conquer, and dynamic programming. Applications include sorting, searching, dynamic structures, path finding, and fast multiplication. Non-deterministic algorithms. Computationally hard problems. NP-completeness. Prerequisites: CS 2123, 3013.
Add to Bulletin (opens a new window)
|
|