CS341 Algorithms Analysis and Design

The course explores algorithms analysis in terms of time complexity and memory (space) complexity. The estimation of the complexity of algorithms will be presented. Polynomial vs NP complete algorithms will be discussed. Algorithm design will be covered as design paradigms, brute force, divide and conquer algorithms, dynamic programming algorithms, greedy algorithms, graph searching and traversal. (Prerequisites: CS242)