About CS 224 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 124. Pre/co-requisites: Recommended: CS 125; STAT 143, STAT 151, or CS 128.

Notes

Prereqs enforced by the system: CS 124

Section Description

Understanding algorithm design methods such as greedy approach, divide and conquer, and dynamic programming; solving various algorithmic problems like graph traversal, network flow, path finding, etc.; proof of algorithm correctness and analysis of algorithm complexity; definition of complexity class NP and NP-completeness; advanced algorithm design methods for hard problems, such as approximation, local search, and randomization.

Section Expectation

Lecture course. 6 to 8 hours of work expected outside the classroom. Partially optional program coding exercises. Required text: Algorithm Design by Kleinberg and Tardos (ISBN-10: 0321295358).

Evaluation

Weekly homework, including written and programming. Exams.

Course Dates

to

Location

Kalkin Building 004 (View Campus Map)

Times

to on Monday, Wednesday and Friday

Important Dates

Note: These dates may change before registration begins.

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.