About CS 5240 A

Studies how to design and analyze computer program algorithms to solve real-world problems. Begins with a review of the concept of algorithm complexity and basic graph algorithms; and then covers algorithm design approaches such as greedy, divide and conquer, dynamic programming, and network flow; then, computational intractability will be treated. Credit not awarded for both CS 5240 and CS 3240. Prerequisite: Familiarity with data structures and elementary algorithms; Graduate student.

Notes

Graduate standing only; Co-located with CS 3240 A; Total combined enrollment: 45; Open to degree and PACE students

Syllabus Unavailable

Please contact the instructor for information about this course.

Important Dates

Note: These dates may change before registration begins.

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

Remind Me Form

Remind yourself about CS 5240 A.

We'll send you a reminder before Fall 2026 registration begins.