The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 408 Weeks Ago, 1 Day Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
1. (50 points) Write a program that uses the brute-force approach to solve the 0/1 knapsack problem. Suppose there arenitems with weightsw1,w2, ...,wnand valuesv1,v2, ...,vnand a knapsack of capacityW. Use the decrease-by-one technique to generate the power set and calculate the total weights and values of each subset, then find the largest value that fits into the knapsack and output that value.
For example: If there are 3 items with the following weights and values:
weight: 8 4 5
value: 20 10 11
and the capacity of the knapsack is 9, your program should then calculate the total weight and the total value of each subset in the power set:
total weight of subset: 0, 8, 4, 12, 5, 13, 9, 17
total value of subset: 0, 20, 10, 30, 11, 31, 21, 41
The largest value that fits into the knapsack: 21
Â
Â
Â
Â
Â
2. (50 points) Leta[0..n-1] be an array ofndistinct integers. A pair (a[i],a[j]) is said to be an inversion if these numbers are out of order, i.e.,ijbuta[i] > a[j].
For example: if arrayacontains the following numbers:
9, 8, 4, 5
then the number of inversions is 5.
(inversions are 9 > 8, 9 > 4, 9 > 5, 8 > 4, 8 > 5)
Â
(a) Write a program that uses the brute-force approach to count the number of inversions in the array.
Â
Â
(b) Write a program that uses the divide-and-conquer technique to count the number of inversion in the array.
Hel-----------lo -----------Sir-----------/Ma-----------dam----------- Â----------- -----------Â ----------- Â ----------- T-----------han-----------k Y-----------ou -----------for----------- us-----------ing----------- ou-----------r w-----------ebs-----------ite----------- an-----------d a-----------cqu-----------isi-----------tio-----------n o-----------f m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on.----------- Pl-----------eas-----------e p-----------ing----------- me----------- on----------- ch-----------at -----------I a-----------m o-----------nli-----------ne -----------or -----------inb-----------ox -----------me -----------a m-----------ess-----------age-----------