Written Assignment 10 -- Due 9:30 a.m. Thursday, November 16
at the beginning of class
CS 3511 Fall Semester, 2006
15 Points
Topics: Math Induction, Recursive Definitions, Recursive Algorithms
Reading assignment:
Sections 4.3 and 4.4 of Chapter 4
( = Sections 3.4, and 3.5 of Chapter 3
of 5th Edition)
Written assignment:
- (3 points)
Exercise 21 Sec. 4.1, page 280 ( =
Exercise 13 Sec. 3.3, page 253 of 5th Ed.).
Hint: You may use the fact (proved in class)
that 2n > 2n + 1 for n ≥ 3
- (3 points)
Exercise 47 Sec. 4.1, page 281 ( =
Exercise 51 Sec. 3.3, page 255 of 5th Ed.)
- (3 points)
Exercise 60 Sec. 4.1, page 282 ( =
Exercise 63 Sec. 3.3, page 256 of 5th Ed.)
- (3 points)
Exercise 35 Sec. 4.2, page 294 ( =
Exercise 67 Sec. 3.3, page 256 of 5th Ed.)
- (3 points)
Exercise 18 Sec. 4.3, page 308 ( =
Exercise 18 Sec. 3.4, page 271 of 5th Ed.)
Page URL: http://www.d.umn.edu
/~ddunham/cs3511f06/assignments/a10/assignment.html
Page Author: Doug Dunham
Last Modified: Monday, 06-Nov-2006 19:28:11 CST
Comments to: ddunham@d.umn.edu