- I’ve posted the slides for Lecture 1 on the website.
- Homework 0 is now online. It will be due next Monday by midnight. Note that when I’ve asked for an algorithm with a specific running time, partial credit will be given for algorithms with slower running times. Unless otherwise specified, I expect to see formal arguments for correctness and running time bounds. Effort, even in the service of a failed solution, will be acknowledged.The last problem is starred, which signifies that (in my mind) it is hard.
- There is now a class mailing list: cs6150@cs.utah.edu. To subscribe, go to the mailing list home page.
This entry was posted
on Monday, August 20th, 2007 at 6:14 pm and is filed under News.
Entries