Lecture 10
Learning objectives
After this class, you should be able to:
- Derive upper and lower bounds on time complexities of algorithms, using integration.
Reading assignment
- Class notes and handout.
- Page 138.
Exercises and review questions
- Exercises and review questions on current lecture's material
- Using integration, derive good upper and lower bounds on the sum of the cubes of the first
n
positive integers.- Questions on next lecture's material
- Assume that we perform the following operation on the rightmost figure in Fig. 4.1 (page 138): push(8); pop(); pop();. Draw the state of the stack on the conclusion of the above operations.
Last modified: 12 Aug 2009