About this document
Knapsack & LCS Problem Solutions by Mahmuda Rahman is a document available to read on EtoBox.
The document provides solutions to two algorithm analysis problems. For the 0-1 knapsack problem with capacity 7, the optimal solution is to include items 2, 4, and 5, with a total price of 50. This is shown through a 5x7 matrix tracking cumulative prices. For the longest common subsequence of strings "AGGTAB" and "GXTXAYB", the LCS is "GTAB" of length 4. This is shown through an 8x8 matrix tracking character matches and arrows indicating the path to the solution.
- Author
- Mahmuda Rahman
- Language
- EN