EECE.3230 Algorithm Analysis and Design

Id: 042774 Credits: 3-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

Course prerequisites/corequisites are determined by the faculty and approved by the curriculum committees. Students are required to fulfill these requirements prior to enrollment. For courses offered through online or GPS delivery, students are responsible for confirming with the instructor or department that all enrollment requirements have been satisfied before registering.