Cell Phone

Cell phone was found in 15211 recitation E. Email me at xfu@andrew.cmu.edu if you lost it.

Extra office hour

Since assignment is due today, holding extra office hour to cover time lapse between Lawrence's and Anthony's + a bit extra on both sides.

Mid-semester grades

These are posted to the HUB. If you have any questions, please visit Chris or me. --Bill

Graphs

PDF: http://www.cs.cmu.edu/~211/content/211Rec7-Graphs.pdf PPT: http://www.cs.cmu.edu/~211/content/211Rec7-Graphs.ppt

Compression

PDF: http://www.cs.cmu.edu/~211/content/211Rec6-Compression.pdf PPT: http://www.cs.cmu.edu/~211/content/211Rec6-Compression.ppt

DP slides

I had a brain malfunction in class during the last example. I've updated my slides and posted them to explain how to get the optimal grouping of the matrices. Sorry for confusion.

Lecture 18: Dynamic Programming 1

Lecture 18, Dynamic Programming 1

Lecture 17: Graphs 3

Lecture 17, Graphs part 3

Office Hours

Due to considerable amount of work, I will not be holding office hours this week.

Debugging Tutorial

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

Course syllabus

The course syllabus (lecture schedule and readings) has been updated. Click on the "Lecture" link to the right. --Bill

Quiz Tomorrow

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.

Lecture 15: Connected Components, Minimum Spanning Trees

Lecture 15, Graphs part 2

Off-by-one error in lecture 14

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.

Lecture 14 : Graphs Part 1

Lecture 14, Graphs part 1

Lecture 13 :Compression

Lecture Lecture 13, Compression

Recitation 4: Heaps

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

Recitation 5: Red Black Trees

PPT: http://www.cs.cmu.edu/%7E211/content/211Rec5-RedBlack-Review.ppt PDF: http://www.cs.cmu.edu/%7E211/content/211Rec5-RedBlack-Review.pdf

Midterm Review

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.