[SOLVED] 代写 C algorithm game Java python statistic Assignment 3 – Memo Table Memory Reduction

30 $

File Name: 代写_C_algorithm_game_Java_python_statistic_Assignment_3_–_Memo_Table_Memory_Reduction.zip
File Size: 847.8 KB

SKU: 4133143774 Category: Tags: , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,

Or Upload Your Assignment Here:


Assignment 3 – Memo Table Memory Reduction
We explored the 0-1 Single Goal Knapsack in class and discussed the memory overhead of the algorithm was about n*W integers, where n is the number of items to pick from and W is the maximum weight knapsack that you’re allowed to have.
We discussed that in order to pick from large numbers of items with higher limitations the memory requirements become impractical very quickly. We also discussed one solution to this situation is not to simply store the value of the Knapsack and instead to also store a record of the items that generate that value within the element itself and to remove all the unneeded memory as we go through the algorithm.
In this assignment you are required to implement a solution that will successfully process a large CSV file. On the game the “Realms of Despair” there are thousands of items players can choose from in order to affect their character’s attributes. These attributes include hit points (HP), mana (MN), movement (MV), damage roll (DR), hit roll (HR), strength (STR), dexterity (DEX), constitution (CON), intelligence (INT), wisdom (WIS), luck (LCK), and many others. You are constrained that you have only 1,000 gold pieces to spend.
We will ignore a lot of the details of the game which would affect our results and you must simply maximize one of these statistics as described in table 1. The sample code includes a file dataFile.csv which you are required to process. I have provided a sample Knapsack implementation in Java, but you are free to implement it yourself in either Python or C (any type).
Use the last digit of your student number to determine which statistic you should optimize
You must report both the value of the knapsack as well as the items that produce the
value.

Please note that it is possible to use the n*W algorithm to solve this problem. Such a result is
equivalent to handing in the starter code and achieves a grade of 0.
NetBeans:
Should work as is.
IntelliJ:
Move dataFile.csv to the project folder and change the path variable to “dataFile.csv”

Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Shopping Cart
[SOLVED] 代写 C algorithm game Java python statistic Assignment 3 – Memo Table Memory Reduction
30 $