|
|
Reading Assignments and Suggested Exercises
| Book: | Introduction to The Design and Analysis of Algorithms, 1st edition | | Author: | Anany Levitin | | Chapter: | 8 |
| Section: 8.2 |
Warshall's and Floyd's Algorithms |
| Reading: | 275-277,280-287 |
| Exercises: | 1,2,3,4,6,7 |
| | Section: 8.3 |
Optimal Binary Search Trees |
| Reading: | 289-294 |
| Exercises: | 1,2,4,5,6,10 |
| | Section: 8.4 |
The Knapsack Problem and Memory Functions |
| Reading: | 295-299 |
| Exercises: | 1,2,3,4,8,9 |
|
| See whole book
|
|
|