Distribution List

1. Course Syllabus
2. There are lecture videos for the GRADUATE-level version of this course. They cover some of the same material but much additional material and may be of interest to students following the undergraduate version. The graduate-level lecture videos are found at
   list of graduate-level videos.
   
   
3. Introduction to complexity and rules of the game Handout for Lecture 1
   
4. First homework
   
5. A rant on induction - useful if you are unsure about how to do inductive proofs Handout for Lecture 1
   
6. Solving recurrence relations by unwrapping and the master method Handout for Lectures 1,2, 3 and 4
   
7. Another exposition on the master method for solving divide and conquer recurrences Handout for Lectures 1,2, 3 and 4
   
8. Second homework
   To do the unwrapping for a recurrence problem on Homework 2, you can assume that the base case is T(n) = cn for some constant c. What c is exactly will not influence the asymptotic solution.
   
9. A full proof of correctness of the algorithm to count the number of inversions. Handout for Lecture 5
   
10. The algorithm Select (S,k) is on page 728 of the book. It defines it as the k'th largest element in S, but in my opinion that is misleading - I would call it the k'th smallest element. To see my point, consider k = 1. In that case the k'th largest element should be the largest element, but following their definition, it is the smallest element.
    
11. For a complete derivation of the mean of the geometric distribution, see page 228, Example 6.4 in the following: a chapter on expected value You only need to read page 228, but the chapter is a good introduction to expected value, especially the early part of the chapter. You will need to understand the expected value of a geometric distribution when we analyze randomized Select and randomized Quicksort.
    
12. Third homework.
    
13. Fourth homework
    On HW 4, problem 5, you can assume that the road is straight with no turns or curves. For extra credit, try to solve the problem where the road is not assumed to be straight. I don't know a solution for that case.
    
14. Fifth homework
    
15. Notes on traceback for the maximum weight independent set problem on a tree. Handout for Lecture 14
    
16. Notes on the unique-decypherability problem. Handout for Lecture 19
    
17. ud.pl Perl program to determine if a code is UD. Handout for Lecture 19
    
18. Sixth homework
    
19. Notes on the Z-algorithm Handout for Lecture 21
    
20. Seventh homework Note, the tone of problem 2 makes it seem that the conjecture is surely correct. It might not be, so don't exclude that possibility.
    
21. Eighth homework