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; this course will be synchronous online from 8/26 to 9/27 and in person starting 9/30"

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.

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.