CS4335 Design and Analysis of Algorithms
Tutorial Three
Exercise 1. . (basic) For fractional Snapsack problem, the thief can carry at most 8
pounds. If the thief finds the following items: (20 dollars, 10 pounds), (22 dollars, 5
pounds), (50 dollars, 100 pounds), (1, dollar, 0.1 pounds), (1 dollar, 0.5 pounds), (5
dollars, 1 pounds), what the thief should choose?
Exercise 2. (basic) For the interval scheduling problem (in week2’s slides), the set of
jobs (si, fi) are as follows:
(0, 6), (1, 4), (3, 8), (2, 3), (6, 9) (4, 10), (5, 11), and (6, 7).
Use the greedy algorithm to give the maximum number of compatible jobs.
If there is still time, please consider the following problem.
Page 31
2005/9/15
CS3335 Design and Analysis of
Algorithms/WANG Lusheng