Program for optimal bin packing Program plan: Import the required package. Create the class “Ex_27”. In the main() function, Create the object to read the number of objects. Read the weight of objects. Execute the for loop until the length of list. Call the method generatePermutation() to generate the permutations possible for the list. Call the method findBest() to find the best container. Execute the for loop to print the containers with respective weight of objects. Define the method findBest(), Return the best bin of the list. Define the method generatePermutation(), Generate the number of permutation possible from the array list. Define the static method firstfit(), Return the item which fits first in the container. Create the class “Bin”, Assign the values of maximum and total weight of bins. Define the method addItem(), Add the weight of item. Define the method getNumberOfObjects(), Return the number of objects. Define the method getTotalWeight(), Return the totalweight. Define the method getMaxWeight(), Return the maximum weight. Define the method toString(), Return the string representation of output.

Question

Want to see the full answer?

Answer 1

Question

Chapter 22, Problem 22.27PE

Program Plan Intro

Program for optimal bin packing

Program plan:

Import the required package.

Create the class “Ex_27”.

In the main() function,

Create the object to read the number of objects.

Read the weight of objects.

Execute the for loop until the length of list.

Call the method generatePermutation() to generate the permutations possible for the list.

Call the method findBest() to find the best container.

Execute the for loop to print the containers with respective weight of objects.

Define the method findBest(),

Return the best bin of the list.

Define the method generatePermutation(),

Generate the number of permutation possible from the array list.

Define the static method firstfit(),

Return the item which fits first in the container.

Create the class “Bin”,

Assign the values of maximum and total weight of bins.

Define the method addItem(),

Add the weight of item.

Define the method getNumberOfObjects(),

Return the number of objects.

Define the method getTotalWeight(),

Return the totalweight.

Define the method getMaxWeight(),

Return the maximum weight.

Define the method toString(),

Return the string representation of output.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Abstract classes & Interfaces (Ch13) 5. See the code below and solve the following. class Circle { protected double radius; // Default constructor public Circle() ( } this(1.0); // Construct circle with specified radius public Circle(double radius) { } this.radius radius; // Getter method for radius public double getRadius() { } return radius; // Setter method for radius public void setRadius(double radius) { } this.radius = radius; // Implement the findArea method defined in GeometricObject public double findArea() { } return radius* radius * Math. PI; // Implement the find Perimeter method defined in GeometricObject public double findPerimeter() { } return 2*radius*Math.PI; // Override the equals() method defined in the Object class public boolean equals(Circlel circle) { } return this.radius == circle.getRadius(); // Override the toString() method defined in the Object class public String toString() { } } return "[Circle] radius = " + radius; 5-1. Define a class name…

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4