Id: 042774 Credits Min: 3 Credits Max: 3

Description

Design, analysis, and application of computing algorithms. Students will practice algorithm design to solve complex computing problems. Exploration of algorithmic paradigms such as greedy algorithms, divide and conquer algorithms, and dynamic programming. Traditional search and ordering techniques and scalability of data structures.

Prerequisites

MATH.2190 Discrete Structures I, and EECE.3220 Data Structures.

View Current Offerings