HOMEWORK 1

CS510

due Wednesday, April 8, 1998
 Your paper must be in my office by 5 pm on this day to receive full credit.

  1. page 25, Exercise 1.1 (5 points)
  2. page 25, Exercise 1.2 (5 points)
  3. page 25, Exercise 1.4 (5 points)
  4. Problem concerning Kevin's Knapsack Problem (5 points):
      Kevin is going camping with the Sierra Club. His backpack can weigh up to 30 pounds and can hold up 1800 in3. He has a list of everything that he wants to bring including the weight and size of each object. He wants to know the maximum number of objects he can take and one occurrence of such a group.
    1. In class we discussed two heuristics for this problem, one sorted by weight and the other sorted by size and then became greedy. Give another heuristic for this problem.
    2. Give an example that shows this is not an algorithm.
    3. What is the complexity of your heuristic? Give an informal reasoning for the complexity of your heuristic.