Algorithms

Catalog description

An algorithm is a procedure for solving a problem in a finite number of steps. Algorithms, along with data structures, form the fundamental building blocks of computer programs. The types of algorithms discussed will include sorting, searching, probabilistic, graph, and geometric algorithms. The following algorithm techniques are covered: backtracking, divide and conquer, branch and bound, greedy method, and dynamic programming. Typically offered Fall. Prerequisite(s): CS 27500 FOR LEVEL UG WITH MIN. GRADE OF C- AND CS 30900 FOR LEVEL UG WITH MIN. GRADE OF C- Course Learning Outcomes 1. Apply asymptotic analysis techniques (e.g., Big-O, Big-Θ, Big-Ω) to determine the time and space complexity of given algorithms. 2. Implement and compare classic algorithms for sorting, searching, and graph problems (e.g., correctness, efficiency, and trade-offs). 3. Design algorithms to solve new computational problems and formally analyze their correctness and computational complexity. View Class Schedule