The course CS 224 A is currently full.

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

We encourage you to contact the instructor to express your interest in this course and topic.

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

About CS 224 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. 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

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, local search, and randomization.

Section Expectation

Students will do written assignments involving proofs and the tracing of algorithms and programming assignments that implement some of the algorithms presented in class. The required text is Algorithm Design by Kleinberg and Tardos (ISBN-10: 0321295358).

Evaluation

There will be two exams. Final grades will be assigned based on written and programming assignments and the exam.

Course Dates

to

Location

James M Jeffords Hall 112 (View Campus Map)

Times

to on Monday, Wednesday and Friday

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.