# CS代考程序代写 algorithm COMP3027/COMP3927 Tutorial questions The University of Sydney 2019 Semester 1 Tutorial 6 School of Computer Science

COMP3027/COMP3927 Tutorial questions The University of Sydney 2019 Semester 1 Tutorial 6 School of Computer Science

Pre-tutorial questions

Do you know the basic concepts of this week’s lecture content? These questions are only to test yourself. They will not be explicitly discussed in the tutorial, and no solutions will be given to them.

1. Dynamic programming technique

(a) What are the three main ingredients in developing a dynamic programming algorithm?

2. Weighted interval scheduling

(a) What are the subproblems?

(b) What is the recurrence? Do you understand the recurrence?

(c) What are the base cases? 3. Knapsack

(a) What are the subproblems?

(b) What is the recurrence? Do you understand the recurrence?

(c) What are the base cases?

Tutorial

Problem 1

Consider the following function computing the n-th Fibonacci number. Algorithm 1 Fibonacci

1: 2: 3: 4: 5: 6: 7:

function Fib(n)

if i==0ori==1then

return i else

return Fib(i − 1) + Fib(i − 2); end if

end function

Draw the tree illustrating the recursive calls for Fibonacci(5). It turns out that the number of leafs in a call tree for Fibonacci is equal to the Fibonacci number itself, which is roughly 1.618n. Write an iterative implementation of Fibonacci(n) that only uses O(n) time and space.

Problem 2

Show all intermediate steps of the dynamic programming algorithm for the weighted interval scheduling problem, for the following input.

1

item

1

2

3

4

5

6

7

8

9

10

start

0

1

0

3

2

4

6

2

7

6

finish

2

3

4

5

6

7

8

9

10

11

weight

2

9

6

5

7

11

8

10

4

6

Problem 3

Consider the following variant of the Interval Scheduling problem we saw in class. The input is defined by a set of intervals I1,…,In. We say that interval Ii = (si,fi) has length fi − si. We would like to pick a set of non-intersecting intervals that use as much as possible of the common resource; that is, we want to maximize the sum of the lengths of the scheduled intervals. Design an efficient algorithm for this problem using dynamic programming.

Problem 4

Solve the following instance of the {0, 1} Knapsack Problem with four items where the maximum allowed weight is Wmax = 10.

Problem 5

Suppose we are going on a hiking trip along the Great North Walk from Sydney to Newcastle. We have a list of all possible campsites along the way, say there are n possible places where we could camp. (Assume campsite are right off the path.) We want to do this trip in exactly k days, stopping in k − 1 campsites to spend the night. Our goal is to plan this trip so that we minimize the maximum amount of walking done on any one day. In other words, if our trip involves 3 days of walking, and we walk 11, 14, and 12 kilometers on each day respectively, the cost of this trip is 14. Another schedule that involves walking 11, 13, and 13 kilometers on each day has cost 13, and is thus preferable. The locations of the campsites are specified in advance, and we can only camp at a campsite.

Using dynamic programming, design an efficient algorithm for solving this problem. Your algorithm should run in O(n2k) time.

Problem 6

Consider a post office that sells stamps in three different denominations, 1c, 7c, and 10c. Design a dynamic programming algorithm that will find the minimum number of stamps necessary for a postage value of n cents. (Note that a greedy type of algorithm won’t necessarily give you the correct answer, and you should be able to find an example to show that such a greedy algorithm doesn’t work.) What is the running time of your algorithm?

Problem 7

You are hired by a financial company to design algorithms to find good investment opportunities. The company has done a lot of research on n different emerging markets. For market i they have a set of investment strategies Si,1 , Si,2 , . . . , Si,k . Strategy Si,j involves investing Ii,j dollars and yields a profit of Pi,j. Because two strategies for the same market typically overlap, for each market you must choose one strategy or not to invest. The company has a budget B for how much it can invest and its goal is to maximize profit.

Design an efficient algorithm for this problem using dynamic programming. (Assume all numbers are integers.)

Problem 8

[Advanced] In class, we designed a dynamic programming algorithm for the knapsack problem that uses

i bi wi

1 25 7

2 15 2

3 20 3

4 36 6

2

O(nW) space where n is the number of items and W is the weight limit. Design a space-efficient algorithm that computes the optimal value that uses only O(W) space.

3