The course CS 3240 B is currently full.

Complete the inquiry form below to help us gauge interest. We will attempt to add more seats in this or a similar course.

Please continue to check the availability of this course—enrollment may vary before the deadline to add:

About CS 3240 B

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

Notes

Prereqs enforced by the system: CS 2240; Open to Degree and PACE Students; Colocated with CS 5240 A; Total combined enrollment = 45

Syllabus Unavailable

Please contact the instructor for information about this course.

Important Dates

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.

Deadlines
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

The maximum enrollment for CS 3240 B has been reached.

Fill out this form to express interest in this course. If a seat becomes available, you will be notified.

Admin