Homework 5
- Assigned: Thursday, Nov. 3, 2011
- Due: Friday,
November 11, 2011 (5pm in 122A mailboxes)
- Required for
Undergraduates: 4 of the following 5
problems
- Required for Graduate Students: 4 of the
following 5
problems
- Points: 10 pts per problem
- General Instructions:
- Please review the homework and grading policy outlined in the course information and homework page.
- On each problem, you must also write down with whom you worked on
the assignment.
- Start early, be concise but rigorous, and enjoy!
- Be sure to review any parts of Chapters 17 and 22
with which you are
not familiar.
- All logs are base 2 unless otherwise specified.
- Unless otherwise specified, all problems and exercises are from
CLRS, Introduction to Algorithms, 3rd edition.
- Exercise 17.2-1. Copying a stack.
- Problem 17-2. Making binary search dynamic.
- Exercises 22.2-6, 22.2-7, breadth first search.
- Exercise 22.3-5, 22.3-11, depth-first search.
- Exercise 22.5-3, 22.5-5 Strongly connected components.
- Exercises 22.1-4, Exercise 23.1-6. Minimum Spanning Trees.
-