Chapter 8: Q49E (page 551)
Find the sequence with each of these functions as its exponential generating function.
Short Answer
.
Chapter 8: Q49E (page 551)
Find the sequence with each of these functions as its exponential generating function.
.
All the tools & learning materials you need for study success - in one app.
Get started for freeLet denote the length of a longest common subsequence ofand, whereand.
Use partsof Exercise 15to show thatsatisfies the recurrence relation,
If both andare nonzero and,
and
If both andare nonzero and, and the initial condition,
If
or
.
In this exercise we construct a dynamic programming algorithm for solving the problem of finding a subset S of items chosen from a set of n items where item i has a weight , which is a positive integer, so that the total weight of the items in S is a maximum but does no exceed a fixed weight limit W. Let denote the maximum total weight of the items in a subset of the first j items such that this total weight does not exceed w. This problem is known as the knapsack problem.
a) Show that if, then
b) Show that if , then.
c) Use (a) and (b) to construct a dynamic programming algorithm for determining the maximum total weight of items so that this total weight does not exceed W. In your algorithm store the values as they are found.
d) Explain how you can use the values computed by the algorithm in part (c) to find a subset of items with maximum total weight not exceeding W.
Prove Theorem 4.
Find the solutions of the simultaneous system of recurrence relations,
Find the generating function for the finite sequence .
What do you think about this solution?
We value your feedback to improve our textbook solutions.