Here is Assignment #5, due 11 pm on August 6. LaTeX source for the assignment will be posted on Piazza (because UBC blogs doesn’t allow upload of .tex files).
-
Recent Posts
Recent Comments
Archives
Categories
Meta
Here is Assignment #5, due 11 pm on August 6. LaTeX source for the assignment will be posted on Piazza (because UBC blogs doesn’t allow upload of .tex files).
Posted in Assignments
Enter your password to view comments.
Posted in Assignments
We’ll start today’s class by discussing complexity classes and NP-completeness. Then we’ll dive into a new worksheet on reductions (used differently than before).
Announcements for today:
Here are today’s clicker questions.
Posted in Handouts
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:
Here are today’s clicker questions.
Posted in Handouts
To help you with question 4 of the assignment, here is the individual version of quiz 4 and a partial sample solution.
Posted in Assignments
In today’s class we’ll work on making our change-making algorithm more efficient using memoization. If we have time, we may also start on a 2D dynamic programming algorithm to compute the longest common substring of two strings.
Announcements for today:
Here are today’s clicker questions.
Posted in Assignments
Here is Assignment #4, due 11 pm on July 30. LaTeX source for the assignment will be posted on Piazza (because UBC blogs doesn’t allow upload of .tex files).
Posted in Assignments
Today we’ll start on our memoization/dynamic programming unit with a worksheet on making change (the kind with coins, not the kind you wish to be/see in the world).
Announcements for today:
Posted in Handouts
Enter your password to view comments.
Posted in Assignments