This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 19 5 DAM2: 2.3: 14 22 5 DAM2: 2.3: 19 25 5 DAM2: 2.3: 22 2.5 27(a) 4 Prove the algorithm described in DAM2: 2.6: 6 is correct Note that to prove correctness you have prove both that the program terminates and that it does the right thing. You can assume that if n=1, the program just returns the input. 2.7 19 5 DAM2: 2.7, 14. Note that p and q could be the same. 2.8 2 5 DAM2: 2.5, 2 2.8 4 5 DAM2: 2.5, 4 2.8 10 5 DAM2: 2.5, 10 Page 1 of 1 Computer Science 280: Homework 2 10/18/2008 http://www.cs.cornell.edu/courses/cs280/2008sp/280hw2.html...
View
Full
Document
This note was uploaded on 10/18/2008 for the course CS 2800 taught by Professor Selman during the Spring '07 term at Cornell University (Engineering School).
 Spring '07
 SELMAN
 Computer Science

Click to edit the document details