Lecture 27: Order statistics

Slides (pdf)

Review for the final

We are considering holding the review session for the final on Dec 13th, from 3-5pm. The 13th is a reading day. Please email me (Chris) if you cannot attend that time.

Extra Office Hours

I'll have extra office hours tomorrow for those who want help with chess from 1-2 PM in WeH 3130.

Lecture 26: Linear time sorting

Slides: (pdf)

Lecture 24: Game search part 2

Slides: (1st half of lecture) (2nd half of lecture)

Late Day Policy for Chess

The deadline will be extended 3 more days until Sunday (Dec. 10) for everyone regardless of how many late days you have left.

Ryan and Vinay are switching office hours

Same times, different people.

Today's lecture: FSMs, part 2

Please bring the handout from the first FSM lecture. --Bill

Second midterm

The 211 staff want to acknowledge that the second midterm exam was very difficult. It is fair to say that some of the questions were more suited to an advanced course. As a remedy, we will reweight the exam and post the grades to FrontDesk. In the next few days we'll compute new overall grades and post them on FD so you can see how you are doing in this new regime. --Bill, Chris, and your loyal TAs

Exams are graded

The exams are graded, and can be picked up outside Prof. Scherlis' office between 7:30 and 3:30 pm. The mean grade was a 62/140 and the median was a 59/140. As a reminder, there will be a curve. We have not figured out what the curve is. However, if you want a rough estimate (and this is only an estimate), C's will start somewhere around 42/140, B's somewhere around 55/140, A's somewhere around 80/140. The TAs will go over the exam next recitation.

Extra Office Hours

I'll have extra office hours today (Wednesday) and be in WeH 3130 from 5:30-6:30.

Videos

Lect 21 game trees link

Lect 20 sorting link

Lect 19 FSM 1 link

Lect 18 dyn prog 2 link

Lect 17 dyn prog 1 link

Lect 16 string search link

Lect 15 graphs 3 link

Lect 14 graphs 2 link

Lect 12 graphs 1 link

Lect 11 compression link

Lect 10 tries skip lists link

Lect 9 stack link

Lect 8 heap link

Lect 7 hash link

Lect 6 trees 2 link

Lect 5 trees 1 link

Lect 3 list link

Lect 2 union find link

Lecture 19 FSM

Slides: (pdf)

Lecture 16 string matching

Slides: (pdf)

String matching and FSMs WON'T be on the exam

Since the lecture notes haven't been put up, the exam will not include questions on those two topics. Note that dynamic programming questions regarding strings are still possible.

Lecture 21 Game Trees

Slides: (pdf)

Sample midterm

A sample midterm can be found here

Jon's Office Hours Cancelled

Due to the midterm exam, I am cancelling my office hours on Thursday.

Midterm and Midterm review

The 2nd midterm is on Nov 9th. It is in-class. You may bring one page of notes (both sides). The exam is closed book and no electronic devices may be used. We will have a review for the midterm on Nov 7, 6-8pm, in Porter Hall 100 (see directions below). Please post requests for topics you would like to see covered during the review session to the discussion board. Directions: 1. Walk across the 5th floor Wean Hall Patio 2. Go into the door directly across from us on the patio level. That's the entry to Porter Hall. 3. Wall down the hallway until you see the staircase on your right. 4. Go up one floor to the first floor of Porter Hall. 5. Turn left and go down the hallway almost to the doorway on Frew Street. 6. Before the doorway, turn left, that is where the review will be held.

Lecture 20 Sorting

Slides: (pdf)