CS 361 Algorithms

Course covers fundamental algorithms and data structures used to solve a variety of problems. These include searching, advanced sorting, graphs, strings and algorithms for solving other hard problems. Develops and explores algorithm design strategies such as divide and conquer, dynamic programming, greedy approaches and backtracking. Algorithm analysis is developed at a more advanced level and includes analysis of recursive algorithms. Covers the classification of algorithms by computational complexity and an introduction to the theory of computation including automata, Turing machines and formal languages.
Credits: 4
Prerequisite: CS 260 and MTH 354

Check course availability in Winter 2024

Check course availability in Spring 2024