CS 3240 A (CRN: 10130)

Computer Science: Algorithm Design & Analysis (A)

3 credit hours

For crosslists see:

About CS 3240 A

Comprehensive study of algorithms including greedy algorithms, divide and conquer, dynamic programming, graph algorithms and network flow. Computational intractability. Approximation, local search and randomization. Credit not awarded for both CS 3240 and CS 5240. Prerequisite: CS 2240. Pre/co-requisites: Recommended: CS 2250; STAT 2430, or STAT 2510.

Notes

Prereqs enforced by the system: CS 2240; Recommended: CS 2250; STAT 2430, or STAT 2510; Co-located with CS 5240 A; Total combined enrollment: 45; Open to Degree and PACE students

Section Description

We will study broad classes of algorithms including greedy algorithms, divide-and-tackle algorithms, dynamic programming, and network-flow algorithms. Students will learn how to characterize the complexity of algorithms. We will discuss NP and NP completeness and advanced algorithm design methods for hard problems, such as approximation.

Students will do written assignments involving proofs and the tracing of algorithms and programming assignments that implement some of the algorithms presented in class.

The recommended text is Algorithm Design by Kleinberg and Tardos (ISBN-10: 0321295358).

Section Expectation

here will be two exams, written assignments, and programming assignments (in Java).

Evaluation

Final grades will be assigned based on written and programming assignments, the exams, and on course attendance.

Important Dates

Courses may be cancelled due to low enrollment. Show your interest by enrolling.

Last Day to Add
Last Day to Drop
Last Day to Withdraw with 50% Refund
Last Day to Withdraw with 25% Refund
Last Day to Withdraw

Resources

Other Sections