Rewrite the preceding program that uses a new greedy algorithm that places an object with the smallest weight into the first bin in which it would fit Your program should prompt the user to enter the total number of objects and the weight of each object The program displays the total number of containers needed to pack the objects and the contents of each container Here is a sample run of the program Does this program produce an optimal solution, that is, finding the minimum number of containers to pack the objects Enter the number of objects 6 Enter the weights of the objects 7 5 2 3 5 8 Container 1 contains objects with weight 2 3 5 Container 2 contains objects with weight 5 Container 3 contains objects with weight 7 Container 4 contains objects with weight 8

Question: Rewrite the preceding program that uses a new greedy algorithm that places an object with the smallest weight into the first bin in which it

Rewrite the preceding program that uses a new greedy algorithm that places an object with the smallest weight into the first bin in which it would fit. Your program should prompt the user to enter the total number of objects and the weight of each object. The program displays the total number of containers needed to pack the objects and the contents of each container. Here is a sample run of the program: Enter the number of objects: 6 Enter the weights of the objects:

Does this program produce an optimal solution, that is, finding the minimum number of containers to pack the objects?

Enter the number of objects: 6 Enter the weights of the objects: 7 5 2 3 5 8 Container 1 contains objects with weight 2 3 5 Container 2 contains objects with weight 5 Container 3 contains objects with weight 7 Container 4 contains objects with weight 8

Step by Step Solution

★★★★★

3.43 Rating (162 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

Program plan Create a class Bin that has a maximum weight and can store only that amount of weight Define its property as maxWeight and totalWeight Cr... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Java Programming Questions!

Rewrite the preceding program that places an object with the largest weight into the first bin in which it would fit. Give an example to show that this program does not produce an optimal solution.

Rewrite the preceding program so that it finds an optimal solution that packs all objects using the smallest number of containers. Here is a sample run of the program: What is the time complexity of...

Write a program that uses a scanner to report some statistics about words in an input sentence (see Section 7.8). The outputs should be the number of words in the sentence, the average word length,...

Write a program that packs the objects of various weights into containers. Each container can hold a maximum of 1 0 pounds. The program uses a greedy algorithm that places an object into the first...

The bin packing problem is to pack the objects of various weights into containers. Assume each container can hold a maximum of 10 pounds. The program uses an algorithm that places an object with the...

with java, every code have to run in to one class. please dont put them in three separate classes. 1. Write the following method that returns the intersecting point between two lines (p1, p2) and...

JAVA PROGRAMMING 3. The bin packing problem is to pack the objects of various weights into containers. Assume that each container can hold a maximum of 10 pounds. The program uses an algorithm that...

using java , please solve it as java and send it as code , step by step 3. The bin packing problem is to pack the objects of various weights into containers. Assume that each container can hold a...

3. The bin packing problem is to pack the objects of various weights into containers. Assume that cach container can hold a maximum of 10 poumds. The program uses an algorithm that places an object...

solve it in java CORRECTLY WITH CODE COMMENT 3. The bin packing problem is to pack the objects of various weights into containers. Assume that each container can hold a maximum of 10 pounds. The...

Mr X and Mr Y are two traders and they argued together, which law is applied here Which court will they go to What process of court will they follow What is the role of the highest court of this...

The following selected transactions apply to Quick Mart for November and December 2010. November was the first month of operations. Sales tax is collected at the time of sale but is not paid to the...

13. Ownership of a corporation is based on . (LO1) a) whether you work for the company b) whether you buy from the company c) whether you hold the bonds of the company d) whether you hold stock in...

11.13. A monopolist serves a market in which the demand is P ! 120 " 2Q. It has a fixed cost of 300. Its marginal cost is 10 for the first 15 units (MC ! 10 when 0 $ Q $ 15). If it wants to produce...

What is the longest (proper) prefix of the string "cgtacgttcgtacg" that is also a suffix of this string?

List the prefixes of the string P ="aaabbaaa" that are also suffixes of P.

Show that randomized quick-sort runs in O(nlogn) time with probability at least 11/n, that is, with high probability, by answering the following: a. For each input element x, define C i, j (x) to be...

Our Chapter 6 discussions will focus on working capital and the financing decision, tell us your reaction to the following: In addition to the companies' high public recognition, they have good...

During the boom years 2010-2014, mutual fund manager Diana Saurus produced the following % rate of return: - Calculate the average return and standard deviation of Ms. Sauros's mutual fund. - Did she...

Question 3 Which of the following is a violation of the principle of open design? 1 point Keeping source code secret to protect proprietary rights over it Publishing a design in a classified journal...