CS270
Combinatorial Algorithms and Data Structures

Spring 2010


Tu/Th 3:30-5 in 405 Soda
CCN: 26791

Richard M. Karp


Announcements

May 5
Please submit final exams Friday, May 7, to Gabe Chang in 253 Cory 8:00am-4:30pm excluding 12-1.
Apr. 28
You can submit your project reports on Friday, April 30, to Jane Doyle in 695 Soda between 10am and 3pm, or to Professor Karp in 621 Soda between 4pm and 5pm.
Apr. 27
In Problem 8(e) of the final exam, change "1+c" to "1-c" and change "APPROX(I) =< (1+c)OPT(I)" to "APPROX(I) >= (1-c)OPT(I)".
Apr. 26
This is simply a reminder that the project report is due in class on Thursday, April 29.
Apr. 16
The final exam will be handed out on April 22 and due on May 7.
Feb. 10
In Problem 8 of Problem Set 1 change the time bound to g(m,n) = O(m) + O(n log log n).
Feb. 9
Discussions will take place regularly W 5-6 in 320 Soda.
Feb. 2
There will be a discussion section tomorrow, Wednesday, from 5-6pm in 611 Soda to discuss topics from the first five lectures.
Jan. 19
Welcome to CS 270!


Course Staff

Syllabus

Lecture Notes

Problem Sets

Term Project

Students may work alone or in two-person teams. There are three options:
  1. Formulating a computational problem related to your research interests and providing and evaluating an algorithm for its solution.
  2. Devising, implementing and testing an algorithm for one of the two challenge problems presented in class.
  3. Writing a report demonstrating your understanding of a paper that has won the Goedel Theory Prize or Kanellakis Theory and Practice Prize.

Seven Exemplary Projects from Previous Offering of the Course

Final Exam