The questions will largely be similar to the exercises in the text and homework. Study the following sections carefully, and be able to solve any of the problems in the exersise or problems set sections refered to below.

- Use of recursion for this method
- Recursive analysis using :
- substitution method
- The recursion-tree method
- The master method

Specifically be able to solve problems like 4-1 and 4-3 on pages 107-108

You may bring a one page "cheat-sheet" with the rules of the master's theorem on it.

- Review the exercises in 8.1 on 193-194.
- Understand the operation and analysis of a counting sort
- Review the exercises in 8.2 on 196-197.
- Review and understand radix sort, exercises on 199-200.

- Review hash table and direct lookup operation, and exercises.

- The cut-rod problem and it solution, analysis, and sections exercises.
- Elements of dynamic programming (15.3).
- What is an optimal substructor? How is it used?
- How does it differ from greedy solutions?
- What is memoization?
- Exercises for 15.3

- Be able to create a dynamic algorithm for an appropriate problem.

Copyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.

Ideas, requests, problems regarding TWiki? Send feedback

Ideas, requests, problems regarding TWiki? Send feedback