4/15/00: As far as the projects are concerned, I felt there wasn't enough time to so anyting new in the last two weeks of class. So I am giving all groups a chance to resubmit their code for the first part. However, you need to make sure that it compiles and runs correctly. Also that it is efficient. You will be graded on the coding style, comments, efficiency, correctness, etc. The final projects will be due on April 27th before class. As before mail the tar and gzipped directory to the TA. Resubmit your report as well, if there are changes.

4/15/00: There are a number of questions being asked by many folks, so I thought I'd answer to the entire class:

Question 1: The question is asking you to minimize the weight of the largest edge included in the spanning tree. You do not have to minimize the sum of the weights.

Question 2: Keep in mind that the size of the queue is a variable; p is not a constant, and n > p. So your goal is to sort the n numbers as efficiently as possible using the new queue.

Question 4: In the unimodal sequence, you are simply given a sequence S of numbers. All you know if that if you WERE to rotate it left by t positions, you would obtain a unimodal sequence. You have to find the maximum value in the sequence S (t is not given). Also is it pointless for t to be more than n-1, i.e, 0 <= t <= n-1.

Question 5: You may NOT assume that the skies or skiers are sorted. Also any of the three cases can happen i) m = n ii) m > n or iii) m < n.

Question 6: A block may be placed on another if the base of the upper is strictly smaller than the base of the lower block. If A x B is the dimensions of the upper base, and C x D the dimensions of the lower base, then it must be the case than A < C and B < D. This supercedes anything I may have said earlier to individual students. Finally, linear dimensions just means simple length.

4/12/00: Your Current Grades are here: CURRENT GRADES . Notify me immediately if there is a discrepancy in your grades for the exam, quizzes, or HWs (The breakdown is: 10% Quiz, 10% Exam I, 20% HW. The remaining elements are: Project 25%, Exam II 15% and Final 20%).

3/27/00: Project is due on the 6th of April. Check out the projects page above for submission instructions.

3/27/00: HomeWork #7: Q16.3-5 ; Q22.2-4; Q24.2-4,5; Q25.2-4; Q25.3-3; Q26.2-5; Q26-1; Q27.2-9; Q27.3-3 (due 4/11)

Extra Credit: Q15.3-7 (from last time; turn in again if you did it last time, it was not graded last time).

Solution for HW7 in Postscript or PDF format.

3/9/00: HomeWork #6: Q7-2 ; Q13.2-2,4 ; Q13.3-4; Q14.1-3,4; Q14.2-1; Q14.3-3; Q15.1-7; Q15.3-4,7 (due 3/23)

Anyone can do Q2-6, which will replace the lowest quiz grade or a missed quiz.

Solution for HW6 in Postscript or PDF format.

2/29/00: HW5 solutions have been updated (it now includes the solution to the bonus Q).

2/17/00: Group and Project List has been added to the link on top. Contact me ASAP if your name doesn't appear anywhere.

2/15/00: Here is a supplementary reference for the adversary arguments: Computer Algorithms, by Sara Baase and Allen Van Gelder, 3rd edition, Addison-Wesley 2000.

2/10/00: HomeWork #5: Q1-3 ; Q2-3 ; Q4-1; Q8-2; Q10-1; Q18-2 (due 2/22)
Extra Credit Q: Find the median of 5 elements using at most 6 comparisons.
Note: Please give the HW directly to Jane Liu (since there is no class on 22nd). Drop it in her mailbox in Amos Eaton Lounge, or personally hand it over to her.

Solution for HW5 in Postscript or PDF format.

2/3/00: HomeWork #4: Q10.1-1 ; Q10.2-2 ; Q12.2-1,2,4 (due 2/10)

Solution for HW4 in Postscript or PDF format.

1/27/00: HomeWork #3: Q3.1-1 ; Q3.2-1 ; Q6.1-1,5; Q6.3-1, Q6.4-2 (due 2/3)

Solution for HW3 in Postscript or PDF format.

1/25/00: NO CLASS TODAY: RPI IS CLOSED STARTING 2:00PM.

1/20/00: HomeWork #2: Q18.1-1,3 ; Q18.3-2 ; Q8.1-2,4 (due 1/27)

Solution for HW2 in Postscript or PDF format.

1/13/00: Homework #1: Q2.1-1,2,4 ; Q2-2 ; Q4.1-1,6; Q4.2-1 ; Q4.3-1 (due 1/20)

Solution for HW1 in Postscript or PDF format.

1/13/00: Please choose your group member. Each group should have 2 members. If you can't find anyone, I'll form groups randomly. Send your group information to the TA via email.