Wednesday, October 31, 2007
Tuesday, October 30, 2007
Friday, October 26, 2007
Thursday, October 25, 2007
PDF: http://www.cs.cmu.edu/~211/content/211Rec7-Graphs.pdf PPT: http://www.cs.cmu.edu/~211/content/211Rec7-Graphs.ppt
Tuesday, October 23, 2007
Monday, October 22, 2007
On Wednesday, Oct 24, there will be an optional session on debugging tools and strategies in Wean Hall 7500. This is meant to help people who are not yet comfortable with debugging tools, or find it hard to locate bugs. Bring your laptops so that you can participate. EDIT: The session will run from 6:30-8:00pm
Friday, October 19, 2007
Tuesday, October 16, 2007
In case you have been missing lectures and recitations recently, there will be a Quiz tomorrow, (Wednesday Oct 17) in recitation. Anything from the semester is fair game. We are more likely to test you on material (a) that we haven't tested before or (b) that we think was problematic for students. With respect to point (b), note that you will have received feedback on such problematic material.
Thursday, October 11, 2007
I had an off-by-one error in my lecture today. Using the definitions I gave in class for the length of a path/cycle, the maximum length of a simple path is n-1, the maximum length of a simple cycle is n. Sorry for the confusion.
Wednesday, October 03, 2007
Sorry these are being posted late! PPT: http://www.cs.cmu.edu/15-211/content/211Rec4-Heaps.ppt PDF: http://www.cs.cmu.edu/15-211/content/211Rec4-Heaps.pdf
Monday, October 01, 2007
The review for the first midterm will be this Wednesday in Wean 7500 from 6:30-8 pm. Please post questions to the discussion board that you would like the TAs to go over during the review. Here is a sample midterm and its solution set.