Office Hours Canceled

My office hours on Tuesday 3/4 will be canceled in favor of grading the midterm. I won't be rescheduling them for later in the week, due to Spring Break, but if anyone has questions, feel free to email me, otherwise I will hold them on my regular night and time after we get back.

Midterm Cheat Sheet

As has been typical of 211 in the past, we will be allowing students to bring one 8.5 x 11 standard sheet of paper to the exam with whatever you choose on it. You may use the front and back of said sheet; handwriting or typed is fine. Like the homework, we encourage you to discuss course material together, but you must make your own sheet. If you have questions, or need something clarified, please post in the topic on the Discussion Board.

Midterm Cheat Sheet

As has been typical of 211 in the past, we will be allowing students to bring one 8.5 x 11 standard sheet of paper to the exam with whatever you choose on it. You may use the front and back of said sheet; handwriting or typed is fine. Like the homework, we encourage you to discuss course material together, but you must make your own sheet. If you have questions, or need something clarified, please post in the topic on the Discussion Board.

Lecture Notes

Additional copies of the lecture notes are outside of Wean 4116.

Lecture 13: Huffman Compression

Lecture 13: information, codes, Huffman compression 6up

Lecture 12: Heaps

Lecture 12: Order statistics and heaps 6up

Lecture 11: 2-3-4 Trees

Lecture 11: 234-Trees 6up

Recitation 7: Huffman Compression

Slides

Additional Office Hour 2/15

I will hold an additional office hour Friday 2/15, 4:00-5:00+pm in Morewood Clusters.

Lecture 10: Binary Search Trees II (Splay Trees)

Binary Search Trees II (PDF) (TXT)

emoose

If you are interested in Uri Dekel's improvements to Eclipse contact him at udekel@cs.cmu.edu. More information can be found at Uri's home page. Your cooperation is much appreciated.

Recitation 5: Dynamic Programming

Here are the solutions to the problem that we worked on in recitation. However the way to do dynamic programming problems is not to just look at solutions. The way to get good at them is to do a bunch of examples.
Solutions

Lecture 5: Hashing (Open Addressing)

Hashing (Open Addressing)

Lecture 4: Hashing (Chaining)

Hashing (Chaining)
Professor Sleator also presented this implementation in java.

Lecture 3: Recurrences/Stacks/Queues

This lecture was based on pages 7 through 10 (panels 36 though 56) of Lecture 2.
Additionally these slides were used to cover stacks and queues.

Lecture 9: Binary Search Trees I

Binary Search Trees I (PDF) (TXT)

Lecture 8: Dynamic Programming III

Dynamic Programming III

Lecture 7: Dynamic Programming II

Dynamic Programming II

Homework 3 : Part A

Here is part A of the dynamic programming homework. This is due at 12:00 NOON (at the beginning of lecture) on Tuesday, February 19. You may not use late days for this part of the homework and you must print out this worksheet and work on it.
Handout

Office hour changed

I'm changing my office hour permanently from Thursday to Tuesday, 7:00 - 8:00, starting from this week. So the next office hour will be on Feb 5th, at WeH 8th floor couch. There will be no change after this. I am sorry for any confusion.

Clarification of Snake Theory Question 2

One of the theory questions for snake says "State a tight Big-Oh bound for..." Please be sure to also explain your answer.