Consider the following pseudocode for a knapsack problem heuristic with capacity b, and n objects with rewards c and weights 1. Set S=0. b = b, I=(1,2,.n) 2. гереat 3. Let jl be the index such that cj z ci, i l. 4. I=1-0). S=S) 5. b =b- aj 6. Remove from I all indices i where ai > b 7. until I=0 8. The objects in set S are the objects in the solution. Implement this algorithm in VBA with n objects and capacity b. First take from the user the values for n and b. Then let rewards be random integer numbers between 5 and 10, and weights be random integer numbers between 1 and 10. Your inputs and solution should be exhibited on an Excel worksheet as well.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Exercise
Consider the following pseudocode for a knapsack problem heuristic with capacity b, and n objects with rewards c and weights
a.
1. Set S = (). b = b, I= (1,2.n)
2. repeat
3. Let jl be the index such that cj z ci, i l.
4. I =1-0), S= S ()
5. b = b - aj
6. Remove from I all indices i where ai >b
7. until I = )
8. The objects in set S are the objects in the solution.
Implement this algorithm in VBA with n objects and capacity b.
First take from the user the values for n and b. Then let rewards be random integer numbers between 5 and 10, and weights be
random integer numbers between 1 and 10. Your inputs and solution should be exhibited on an Excel worksheet as well.
Transcribed Image Text:Exercise Consider the following pseudocode for a knapsack problem heuristic with capacity b, and n objects with rewards c and weights a. 1. Set S = (). b = b, I= (1,2.n) 2. repeat 3. Let jl be the index such that cj z ci, i l. 4. I =1-0), S= S () 5. b = b - aj 6. Remove from I all indices i where ai >b 7. until I = ) 8. The objects in set S are the objects in the solution. Implement this algorithm in VBA with n objects and capacity b. First take from the user the values for n and b. Then let rewards be random integer numbers between 5 and 10, and weights be random integer numbers between 1 and 10. Your inputs and solution should be exhibited on an Excel worksheet as well.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY