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!)
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.
Today we’ll finish up our 2-D DP handout.
- For Monday, please read section 6.8 (the last required section in the dynamic programming chapter, although I recommend the other sections as interesting reading, particularly if you’re continuing on to CPSC 445, which uses DP heavily). No reading quiz.
- Don’t forget we have an assignment due Thursday! Keep up with the post pinned on Piazza with some (largely minor but still important) updates on the assignment.
We’ll continue our longest common subsequence problem in class today.
- Get started on the Assignment somewhat dubiously numbered “4” that is due on Thursday 10 Nov! It’s posted on this blog.
- Read Section 6.6 and complete the pre-class quiz by noon Friday.
- If you have US citizenship: vote! I did 🙂
Here are several resources:
Today we’ll work on dynamic programming in two dimensions.
- Here are the new DP in 2-D notes for today.
- For next lecture, please read section 6.5 in the textbook. (No reading quiz for Wed, however.)
- Tue/Wed tutorial students: remember the quiz this week!
- Everyone: get started on the so-far-released quiz/assignment questions.