CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #1, due Thursday, January 25th , 2007 at 10:00
[12] 1. Consider three functions f , g and h from N into R+ . Prove each of the following
assertions, using the denition of O, , etc.
[6] a. max
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #8, due Tuesday, April 10th , 2007 at 10:45
[20] 1. Consider the following game: there is a set of letters, where each letter c is assigned
a value value(c). A random string S of 2n letters i
Amortized Analysis: a Summary
Patrice Belleville Department of Computer Science University of British-Columbia November 8, 2010
1
What is amortized analysis?
Amortized is a topics in analysis of algorithms that is unfortunately not covered well in most te
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #5, due Thursday, March 8th , 2007 at 10:45
[18] 1. In algorithm DeterministicSelect, the input elements are divided into n/5 groups of 5 elements each (and
maybe one group with less than 5 e
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #2, due Thursday, February 1st , 2007 at 11:00
[9] 1. Consider the problem of nding an element elem in a sorted array. Let A be an
algorithm that solves this problem, where the only operation
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #4, due Tuesday, February 27th , 2007 at 10:45
[9] 1. In class, we took algorithm Select1, and then modied it to pick a random pivot instead of always using the last element of the array. We
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #7, due Thursday, March 29th , 2007 at 10:45
[10] 1. Let G = (V, E ) be an undirected graph, and w : E R+ be a weight function
that assigns a positive weight to every edge of G. Assume that y
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #6, due Thursday, March 15th , 2007 at 10:45
[10] 1. As mentioned in class, while we normally augment a skip list by storing along each
pointer a value about the nodes that the pointer skips
CPSC 320: Intermediate Algorithm Design and Analysis
Assignment #3, due Thursday, February 8th , 2007 at 10:45
[8] 1. Determine whether or not each of the following recurrence relations can be solved by
applying the Master theorem. Justify why or why not,