This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 473: Algorithms, Fall 2010 HBS 6 Problem 1. [Minimum Spanning Tree] Draw the edges in the Minimum Spanning Tree for the following graph. Given G and MST T , suppose you d ecrease the weight of an edge e not in T . Give an algorithm to recompute the MST in O ( n ) time. Problem 2. [Stock Picking] You have a group of investor friends who are looking at n consecutive days of a given stock at some point in the past. The days are numbered. i = 1 , 2 ,...,n . For each day i , they have a price p ( i ) per share for the stock on that day. For certain (possibly large) values of k , they want to study what they call k-shot strategies . A k-shot strategy is a collection of m pairs of days ( b 1 ,s 1 ) ,..., ( b m ,s m ), where 0 m k and 1 b 1 < s 1 < b 2 < s 2 < b m < s m n We view these as a set of up to k nonoverlapping intervals, during each of which the investors buy 1,000 shares of the stock (on day b i and then sell it (on day s i . The return of a given k...
View Full Document
This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
- Fall '08