July 29 Handouts and Notes

Today we will continue working on a 2D dynamic programming algorithm to compute the longest common substring of two strings. If we have time, we may start talking about NP-completeness.

Announcements for today:

  • Assignment #4 is due tomorrow at 11 PM.

Here are today’s clicker questions.

Leave a Reply

Your email address will not be published. Required fields are marked *