4005-800-70 Theory of Computer Algorithms
Module 1 Homework Assignment

Reading
Problems
No Submission

• Cormen, Leiserson, Rivest, & Stein, Chapter 1.
• Cormen, Leiserson, Rivest, & Stein, Chapter 2.

1. Cormen, Leiserson, Rivest, & Stein, Exercise 1.1-1, page 10.
2. Cormen, Leiserson, Rivest, & Stein, Exercise 1.2-2, page 13.
3. Cormen, Leiserson, Rivest, & Stein, Exercise 1.2-3, page 13.
4. Cormen, Leiserson, Rivest, & Stein, Problem 1-1, page 13.
5. Cormen, Leiserson, Rivest, & Stein, Exercise 2.1-3, page 21.
6. Cormen, Leiserson, Rivest, & Stein, Exercise 2.2-1, page 27.
7. Cormen, Leiserson, Rivest, & Stein, Exercise 2.2-3, page 27.
8. Cormen, Leiserson, Rivest, & Stein, Exercise 2.3-1, page 36.
9. Cormen, Leiserson, Rivest, & Stein, Exercise 2.3-3, page 36.
10. Cormen, Leiserson, Rivest, & Stein, Problem 2-1(a), page 37.
11. Cormen, Leiserson, Rivest, & Stein, Problem 2-1(b), page 38.
12. Cormen, Leiserson, Rivest, & Stein, Problem 2-1(c), page 38.
13. Cormen, Leiserson, Rivest, & Stein, Problem 2-1(d), page 38.

The Module 1 homework assignment will not be submitted or graded.

Theory of Computer Algorithms 4005-800-70 Winter Quarter 2003

Course Page

Alan Kaminsky • Department of Computer Science • Rochester Institute of Technology • 4486 + 2220 = 6706

Home Page

Copyright © 2003 Alan Kaminsky. All rights reserved. Last updated 02-Dec-2003. Please send comments to ark­@­cs.rit.edu.