(07-12-04) The text of the Final Exam is available and due in the 313 homework box (1st floor Deschutes Hall) on Thursday, December 6 by 4 pm.
(07-12-04) Sorry for not completing my assignment for the day: the full text of the Final Exam (take home, open the textbook and a page of notes, closed other text and the computers, positively no communication with anybody on the subject of the test except the instructor) will be available by midnight. In the mean time, you can get started on Problem 5 of the test.
(07-12-03) Solutions to Assignment 5 are posted. You can collect your graded assignment from Andrzej.
(07-12-01) Pre-final discussion session on Monday, Dec. 2 at 3:00pm in 260 Deschutes.
(07-11-30) Final exam will be take home, due in the "homework box" at 3pm. on Thursday, Dec. 6. I will post the text on the web no later than Tuesday at 5pm.
(07-11-30)
An interesting contribution to the discussion of correctness:
Richard A. De Millo , Richard J. Lipton , Alan J. Perlis, Social processes and proofs of theorems and programs, Communications of the ACM, v.22 n.5, p.271-280, May 1979
(07-11-16) Class evaluations (avg±stdev for 9 respondents):
Novelty: 7.1±2.03
Difficulty: 6.4±1.59
Pace: 6.0±1.22
Clarity: 4.3±1.12
no comments? (Novelty and difficulty seem to have increased slightly, but this characterization is not uniformly shared. Perception of increased pace and decreased clarity may be partially due to this.)
(07-11-5) Unfortunately, there was also a "typo" in the question II.4 "Top(S).day is indeed the correct value", which originated in a typo in the body of the outer loop:
S=Empty Stack;
push(S,(\infty, 0); k=1;
while k<=n do
{while p[k]>=Top(S).price do Pop(S);
h[k]=Top(S).day; Push(S,(p[k],k)); k=k+1}
I am sorry for this lapse; when needed, there will be extra time for completion of II.4-5
(07-11-5) Clarifications on some Midterm questions:
I.3 "assuming constant time push, pop, and isEmpty? operations"
III.3 "T_n defined as the number"
IV.1 "Give their values (for sufficiently large n)"
(07-11-2) Both parts of the Midterm Exam are now available. Solutions are due in the "Homework Box" by noon on Tuesday. Please adhere to the Honors Code.
(07-11-2) To keep my word, I have posted the first part of the take-home midterm exam. The second part (filling the blanks in the current file) will be posted tonight.
(07-11-1) Class evaluations (avg±stdev for 12 respondents):
Novelty: 6.7±2.06
Difficulty: 5.8±1.53
Pace: 5.2±0.83
Clarity: 5.2±1.54
no comments
(07-10-31) Midterm Study Guide (light) is posted. Take-home midterm exam will be posted before noon on Nov. 2 and due at noon Nov. 6 (in the homework box on the 1st floor.)
(07-10-03) Homework exercise: W side of the table: analyze the Russian Peasant multiplication algorithm by stating a loop invariant.
E side of the table: formalize and analyze complexity of sub-quadratic recursive multiplication algorithm.
(07-10-02) Assignment 1 due date has been moved back to Oct. 9