Welcome to the home page for the Computer Science Department's **
Graduate Algorithms** course CLA CS 530.
This is the starting point for online course information and documentation.

Here is the most recent *CS 530* Course News.

A practice final .

Here is the current homework, HW5 .

And here are a few pages of additional introductory reading on randomized algorithms (Part 1) , reading on randomized algorithms (Part 2).

and the powerpoint of some nice lectures on linear programming.

Here are past homeworks: hw0, HW1, Homework 2,HW3 , HW4 .

Here you can find some homework solutions. solutions for HW0, brief solutions for HW1, brief solutions for HW2,brief solutions for HW3, brief solutions for HW4.

*CS 530* is the central graduate algorithms course in the
computer science curriculum. It serves as the a core graduate theory
course. It is the successor to the undergraduate
algorithms course, CS 330, and has this course as a prerequisite.
In CS 530 students will learn fundamental algorithm design and
algorithm analysis at the graduate level.
The following list of pointers provides access to information
concerning the course, the students and the instructors.

- Course Information
- Computer Science Department Information
- Help and Other Places in Cyberspace (courtesy of A. Kfoury)
- A Historical Note
- Steve Seiden's Cheat Sheet(ten pages of commonly used formulas in computer science).

Page prepared by Steve Homer