1. Engineering
  2. Computer Science
  3. i would appreciate if someone could help me with this...

Question: i would appreciate if someone could help me with this...

Question details
I would appreciate if someone could help me with this algorithm question . Thank you
Fractional Knapsack Problem An edited book has 6 articles. The table shows the lengths of the articles and their importance, where the scale of importance is 1(low) to 10(high). The book must be at most 150 pages long. The problem is to edit the book so that the overall importance is maximized. Edit the book by choosing articles whose pages and importance are given in the above table. i.e. Give A. the chosen articles with its pages, B. the importance for each chosen article and C. the total maximum importance of the edited book. 2. Consider a greedy rule for the above Fractional Knapsack Problem that selects the articles in non-decreasing order of pages. If the capacity of the knapsack is not exceeded, we take all of the pages. Otherwise, we take whatever portion of the article fills the knapsack and stop. Give an example to show that this greedy algorithm does not necessarily maximize the importance.
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution