# Greedy Algorithms Minimum Spanning Trees and Dynamic Programming Problem Set #4 Quiz Answer

## Greedy Algorithms Minimum Spanning Trees and Dynamic Programming Problem Set #4 Quiz Answer

In this article i am gone to share Coursera Course Greedy Algorithms Minimum Spanning Trees and Dynamic Programming Problem Set #4 Quiz Answer with you..

#### Problem Set #4

Question 1)

Consider a variation of the knapsack problem where we have two knapsacks, with integer capacities W1 and W2. As usual, we are given n items with positive values and positive integer weights. We want to pick subsets S1, S2 with maximum total value (i.e., ∑i∈s1 vi + ∑i∈s2, ví) such that the total weights of S1 and S2 are at most W1 and W2, respectively. Assume that every item fits in either knapsack (i.e., Wi <min{W1,W2} for every item i). Consider the following two algorithmic approaches. (1) Use the algorithm from lecture to pick a a max-value feasible solution S1 for the first knapsack, and then run it again on the remaining items to pick a max-value feasible solution S2 for the second knapsack. (2) Use the algorithm from lecture to pick a max-value feasible solution for a knapsack with capacity W1 +W2, and then split the chosen items into two sets S1, S2 that have size at most W1 and W2, respectively. Which of the following statements is true?

• Neither algorithm is guaranteed to produce an optimal feasible solution to the original problem.
• Algorithm (1) is guaranteed to produce an optimal feasible solution to the original problem but algorithm (2) is not.
• Algorithm (2) is guaranteed to produce an optimal feasible solution to the original problem but algorithm (1) is not.
• Algorithm (1) is guaranteed to produce an optimal feasible solution to the original problem provided W1 = W2.

Question 2)

Recall the dynamic programming algorithms from lecture for the Knapsack and sequence alignment problems. Both fill in a two-dimensional table using a double-for loop. Suppose we reverse the order of the two for loops. (I.e., cut and paste the second for loop in front of the first for loop, without otherwise changing the text in any way.) Are the resulting algorithms still well defined and correct?

• Both algorithms remain well defined and correct after reversing the order of the for loops.
• The Knapsack algorithm remains well defined and correct after reversing the order of the for loops, but the sequence alignment algorithm does not.
• The sequence alignment algorithm remains well defined and correct after reversing the order of the for loops, but the Knapsack algorithm does not.
• Neither algorithm remains well defined and correct after reversing the order of the for loops.

Question 3)

Consider an instance of the optimal binary search tree problem with 7 keys (say 1,2,3,4,5,6,7 in sorted order) and frequencies w1 = .05, w2 = .4, w3 = .08, w4 = .04, w5 = .1, w6 = .1, w7 = .23. What is the minimum-possible average search time of a binary search tree with these keys?

• 2.18
• 2.42
• 2.9
• 2.08

Question 4)

The following problems all take as input two strings X and Y , of length m and n, over some alphabet E. Which of them can be solved in Omn) time? [Check all that apply.]

• Consider the following variation of sequence alignment. Instead of a single gap penalty Qgap, you’re given two numbers a and b. The penalty of inserting k gaps in a row is now defined as ak +b, rather than ka gap. Other penalties (for matching two non-gaps) are defined as before. The goal is to compute the minimum-possible penalty of an alignment under this new cost model.
• Compute the length of a longest common substring of X and Y. (A substring is a consecutive subsequence of a string. So “bcd” is a substring of “abcdef”, whereas “bdf” is not.)
• Compute the length of a longest common subsequence of X and Y. (Recall a subsequence need not be consecutive. For example, the longest common subsequence of “abcdef” and “afebcd” is “abcd”.)
• Assume that X and Y have the same length n. Does there exist a permutation f, mapping each i  ∈ {1,2,…,n} to a distinct f(i) ∈ {1, 2,…,n}, such that Xi = Y f(i) for every i = 1,2,…,n?

Question 5)

Recall our dynamic programming algorithms for maximum-weight independent set, sequence alignment, and optimal binary search trees. The space requirements of these algorithms are proportional to the number of subproblems that get solved:  ⊖(n) (where n is the number of vertices), ⊖(mn) (where m, n are the lengths of the two strings), and (n2) (where n is the number of keys), respectively.

Suppose we only want to compute the value of an optimal solution (the final answer of the first, forward pass) and don’t care about actually reconstructing an optimal solution (i.e., we skip the second, reverse pass over the table). How much space do you then really need to run each of three algorithms?

• ⊖(n), ⊖(mn), and ⊖(n2
• ⊖(1), ⊖(n), and ⊖(n2)
• ⊖(1), ⊖(n), and ⊖(n)
• ⊖(1), ⊖(1), and ⊖(n)