CSCE 321/2202 - Analysis and Design of Algorithms (3 cr.)

Prerequisites

(or concurrent) and CSCE 2211

Concurrent
CSCE 2203
Description
Analysis and complexity bounds of basic classes of algorithms. Basic algorithm design methodologies: Brute force, Transform and Conquer, Divide and conquer, and Greedy methods. Dynamic Programming, Backtracking and Branch and Bound methods. Applications to problems such as sorting and searching, traveling salesperson, knapsack, optimal merge patterns and graph algorithms. Introduction to the theory of complexity.

When Offered
Offered in fall and spring.

Check course scheduling information

AUC New Cairo Campus

AUC Tahrir Square Campus

New York

CSCE 321/2202 - Analysis and Design of Algorithms (3 cr.)