Here’s the full assignment, with LaTeX source (extension .txt for posting), and the figure with the boxes.
The assignment is due Thursday 24 Nov at 10PM. For more details, see the assignment itself. Have fun!
2016W1
Here’s the full assignment, with LaTeX source (extension .txt for posting), and the figure with the boxes.
The assignment is due Thursday 24 Nov at 10PM. For more details, see the assignment itself. Have fun!
Here’s the assignment version of the Tue 1PM quiz.
Today we continue to talk about reductions and NP-completeness.
Here’s the assignment version of the Mon 3PM quiz.
Here’s the assignment version of the Mon 9AM quiz.
This should be considered “just for fun” handouts, as long as you are confident you are capable of implementing something like LCS in whatever your favorite language is, given sufficient time.
With that caveat, here’s a PDF of our LCS implementation, with some extra embellishments toward the end, including patching the code we didn’t quite finish.
Today we’ll start talking about NP-completeness with special guest host and TA Raunak Kumar! Thanks, Raunak!
Today we’ll do some live-coding. Fun! Adventure! Steve making ridiculous mistakes and writing strange-looking code! 🙂
(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!)
Here is a sample solution to the DP in 2-D notes.