To use a late day in FrontDesk, just submit late. FrontDesk will keep track of your status.
Saturday, September 30, 2006
Thursday, September 28, 2006
Wednesday, September 27, 2006
Homework 2 Deadline Extended
The deadline for the snake lab has been extended until Saturday, September 30 at 11:59 PM. Enjoy!
Tuesday, September 26, 2006
Monday, September 25, 2006
Will's Office Hours Cancelled
I am going to have to cancel my office hours this Thursday because I will be out of town. I just wanted everyone to know before they made plans to attend.
Thursday, September 21, 2006
Tip: Submit Early & Often
Help FrontDesk help you by submitting your homework early and often. There is no penalty for making submissions before you've fully completed the assignment. In fact FrontDesk has features that specifically target early submissions:
- When evaluating JUnit tests, FrontDesk only considers how well you test the code that you have written. If you've only written the Queue, we'll only hold you accountable for tests on that class.
- FrontDesk targets the tests it shows you to how far along you are. If you haven't started the HashSet, but have worked on Queue, FrontDesk will show you exceptions in the Queue class.
Submitting early is a great way to get early feedback on how you are doing, evaluate the strength of your unit tests, and harness the automated bug finding power of FindBugs. Submitting early is a great way to help your TA help you. TAs are able to see your submissions, so asking a question about your code is as easy as talking to your TA via email or in office hours.
Wednesday, September 20, 2006
Snake Help Session: Sunday
We're running a help session for snake on Sunday from 7-9pm in the Wean Hall Linux clusters. To make the most effective use of your time, start the homework before the session starts, and then come with questions.
Tuesday, September 19, 2006
Friday, September 15, 2006
Thursday, September 14, 2006
Tuesday, September 12, 2006
Friday, September 08, 2006
Lecture 4 notes are up
Hi, I've put the notes for lecture 4 (analysis of algorithms) up. They are slightly different than the ones handed out in lecture. In particular, they correct an error on the last 4 slides on the intuition behind the master method. The amount of work done per level is a^i*f(n/b^i) at the i'th level in the tree. The notes handed out in class incorrectly listed the amount of work as a^i*f(n). Sorry for the confusion. I will go over this briefly in class on Tuesday.
Wednesday, September 06, 2006
Tuesday, September 05, 2006
Lecture Slides Posted
We've posted slides for the first three lectures and the first recitation in the Lectures section. Sorry for the delay.
Friday, September 01, 2006
Subscribe to:
Posts (Atom)