Monthly Archives: November 2016

Lecture 2016/11/09

Today we’ll start talking about NP-completeness with special guest host and TA Raunak Kumar! Thanks, Raunak!

  • Here are our notes on NP-completeness.
  • Don’t forget that there’s an assignment due Thursday!
  • Please read┬áSection 8.2 and skim Section 8.10 for this coming Monday. Keep skimming 8.10 as we read each section. It will help to keep the problems straight in your head! (Note that we won’t discuss every type of problem categorized in 8.10, however.)
  • No reading quiz for Monday. (It’s a long weekend; have fun, remember those who have served the country, but do think for at least a while about algorithms!)

Lecture 2016/11/07

Today we’ll do some live-coding. Fun! Adventure! Steve making ridiculous mistakes and writing strange-looking code! ­čÖé

  • For Wednesday, please read Section 8.1 (and the very important intro to Chapter 8) and complete the reading quiz due at noon on Wednesday.

    (Note: I know this is a long-ish section. I hope you’ll find that, since we’ve already discussed reductions many times, this will be a new twist on how to use them but not brand new material. Take time over the next week or so to consolidate your understanding of this very important section!)

  • No new handouts for today.
  • Come to class Wednesday, but don’t forget that Friday is a holiday: no class and no office hours.