The 0-1 knapsack problem. Given six items {(vi , wi)} for i = 1, 2, . . . , 6 as follows: i vi wi 1 40 100 2 35 50 3 18 45 4 4 20 5 10 10 6 2 5 and the total weight W = 100, where vi and wi are the value and weight of item i, respectively. Find the greedy solutions by using following strategies: 1 (a) Greedy by value, i. e., at each step select from the remaining items the one with the highest value (b) Greedy by weight, i. e., at each step select from the remaining items the one with the least weight. (c) Greedy by value density, i. e.,

Ou listened to a song on your computer. did you use hardware or software?

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it

You have a small company and want to keep your costs low, but it is important your employees share data. which network would provide you with the most economical solution?