There's two programs:
1) Write a program called matmult.s that implements matrix
multiplication in assembly.
Write a program called knapsack.s that solves the 0-1 knapsack problem
recursively. In the knapsack problem you have a knapsack that can hold W weight. You also have a collection of items that each have their own weight wi and value vi . The goal is find the set of items that maximizes the amount of value in the knapsack but whose weight does
not exceed W.
3 freelancers are bidding on average $148 for this job
I am an expert in C/C++ programming and would like to do your work. I would like to have further discussion s over the project. If you do desire i can show you a demo now.