503_HW3_S11 - UML CS Analysis of Algorithms 91.503(section...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.503 (section 201) Spring, 2011 page 1 of 2 Homework #3 Assigned: Friday, 2/11 Due: Tuesday, 2/22 at start of lecture This assignment covers textbook material in Chapter 17 (Amortized Analysis) and the paper “Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs.” 1. (15 points) Aggregate Method & Stack: Textbook Exercise 17.1-1 on p. 456. 2. (15 points) Accounting Method & Stack: Suppose that the actual cost of a stack POP operation becomes 2 instead of 1. a) What is the effect on the actual cost of a stack MULTIPOP in this case? b) Using the accounting method, is it still possible to achieve amortized time in O(1) per operation for each of the stack operations? 3. (35 points) Dynamic Table: ( modified from Goodrich and Tamassia ) In this problem, consider a dynamic table with TABLE-INSERT but no TABLE-DELETE operation. The behavior is the same as in Section 17.4.1 of our textbook with the following exceptions. When the table is full, the table expands from
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/13/2012 for the course CS 91.503 taught by Professor Staff during the Spring '11 term at UMass Lowell.

Page1 / 2

503_HW3_S11 - UML CS Analysis of Algorithms 91.503(section...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online