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

Prerequisites

and

Description
Design and analysis of basic classes of algorithms: Divide and conquer, greedy methods, tree and graph traversals, and backtracking. Applications to problems such as sorting and searching, traveling salesperson, and knapsack. 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/3201 - Analysis and Design of Algorithms (3 cr.)