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.
Section Expectation
The required text is Algorithm Design by Kleinberg and Tardos (ISBN-10: 0321295358).
Evaluation
There will be two exams, written assignments, and programming assignments (in Java).
Important Dates
Note: These dates may change before registration begins.
Note: These dates may not be accurate for select courses during the Summer Session.
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
There are no courses that meet this criteria.
Interest Form
Remind yourself about CS 3240 A.
We'll send you a reminder before Spring 2025 registration begins.