1) Homework 1 is due on Tuesday Jan 22, 2002 2) HINT for homework problem has been updated. Jan 18, 2002 3) Homework 2 is posted. It is due on Tuesday Jan 29th, 2002 4) Reading list updated. 5) Pick up graded HW1 from BH 4428 -- Jan 31, 2002 6) Homework 3 is due on Feb 6, 2002. There are eight questions for Homework 3 -- 6 are on the pdf/ps file, and 2 are on the home work page. You DO NOT have to solve Problem 4 (weighted median) and Problem 6 (Maximum Consecutive Subsequence sum) problems. 7) Reading material for Midterm 2.8 together with specialization to underlying complete graph. binary rep. 2.12 3.2 3.3 4.2 4.3.2 all of 5. 15.2 in white book
Knapsack, and longest common subsequence, and then on greedy - the activity scheduling and Huffman coding. Techniques to learn ------------------- 1) Recursion/Design by Induction 2) Dynamic Programming 3) Divide and Conquer 4) Greedy