Objectives: In this lab, the following topic will be covered: 1. Array Lists Task The bin packing problem is to pack the objects of various weights into containers. Assume each container can hold a maximum of 10 kg. The program uses an algorithm that places an object 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: 7 5 2 3 58 Container 1 contains objects with weight 7 2 Container 2 contains objects with weight 5 3 Container 3 contains objects with weight 5 Container 4 contains objects with weight 8

Objectives: In this lab, the following topic will be covered: 1. Array Lists Task The bin packing problem is to pack the objects of various weights into containers. Assume each container can hold a maximum of 10 kg. The program uses an algorithm that places an object 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: 7 5 2 3 58 Container 1 contains objects with weight 7 2 Container 2 contains objects with weight 5 3 Container 3 contains objects with weight 5 Container 4 contains objects with weight 8

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

Project 5 - Magic Squares Objectives The objective of this project is to have students practice with two-dimensional arrays and loops. Specifications In this project, you will write code to determine if a two-dimensional array of ints is a Magic Square. For a two- dimensional array of ints to be a Magic Square all of the following must be true: 1. The array must be square - in other words, the lengths of all rows and all columns must be the same. 2. The array must contain all integers from 1 to n*n, where n is the length of the rows and columns. 3. The sum of the numbers in each diagonal, each row, and each column must be the same. You have been given two classes: • MagicSquareTest.java - Contains JUnit test cases for the MagicSquare class. Your code must pass all these tests. • MagicSquare.java - contains static methods to determine if a two-dimensional array of ints is a Magic Square: o isMagicSquare() - returns true if a two-dimensional array of ints meets all the criteria to be a…
In visual basic Write a For…Next loop that will printout each value in the array from problem 4.
Task - Median elements (C Langugage) Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the median of the values in a. This function should use pointer arithmetic– not subscripting – to visit array elements. In other…
C++ language Write a program that asks the user to enter daily sale for five stores and record them in an array.The program should then display a bar graph comparing each store’s sales for all days of a week.Create each bar in the bar graph by displaying a row of asterisks. Each asterisk should representRs.1000 of sales. The program also calculates the total sale each day, and total sale of the week.Here is an example of the program s output.Enter day 1 sales for store 1: 4000 [Enter]Enter day 1 sales for store 2: 6000 [Enter]Enter day 1 sales for store 3: 10000 [Enter]Enter day 1 sales for store 4: 11000 [Enter] Enter day 1 sales for store 5: 3000 [Enter]Enter day 2 sales for store 1: 9000 [Enter]Enter day 2 sales for store 2: 8000 [Enter]Enter day 2 sales for store 3: 19000 [Enter]Enter day 2 sales for store 4: 7000 [Enter]Enter day 2 sales for store 5: 9000 [Enter]…(and so on.)Weekly SaleMonday: Total Sale: 34,000/-Store 1: **** (4000)Store 2: ****** (6000)Store 3: **********…
Problem2: 2D Arrays Define a 2D array using Java code that takes from a teacher the total number of rows and the total number of columns. Then let the teacher fill the array by students IDs and courses marks for each student. And print the following: 1- Print the array. 2- Print the marks that are less than 50 (mark < 50)
Problem2 Write a program that display the position of a given element in an array. You should print the index (i.e. the position) of the element. If the element appears more than one time than you should print all its positions. The size of the array should be entered by the user. If the element does not occur then you should display element not found. Sample1: Enter the size of the array: 5 Enter an array of size 5: 44 5 13 44 67 Enter the element to find: 44 44 is found at position 44 is found at position 44 occurs 2 time(s) Sample2: Enter the size of the array: 4 Enter an array of size 4: 12 150 17 20 Enter the element: 18 18 is not found
Individual Exercise: Sieve of Eratosthenes O The Sieve of Eratosthenes is a technique for finding all the prime numbers up to a given last number. o It can be implemented as a program by using the algorithm (steps) given below. " Create a variable for the last number initialized as 100 etc. (e.g., int lastNumber = 100;) • Create a boolean array isPrime[] to keep track of which numbers up to lastNumber are prime. O The length of the array must be equal to lastNumber + 1 as the array indexes start from zero. o Note: The default value is false for all the array elements when a boolean array is created by using new. ' Set all the array elements beginning from index = 2 (the first prime number) to true. ' Outer loop: Repeat the following steps for each number num within 2 <= num <= lastNumber / num. o if isPrime[num] is true (meaning that num is prime as no factors exist for num): " Inner loop: Set the isPrime[] elements for all the multiples of num to false. O When the nested loop ends,…
Problem Statement – You are to create a program to play Tic-Tac-Toe. The program should initially explain that this program is a Tic-Tac-Toe game. The program must include the following: The board must be represented as a one dimensional array. The board must be printed after each user selects a position on the board. Directions must be printed to the screen. The directions should include a copy of the board with each position labeled in the board. The game should allow two players to alternate providing their selected position. The first player will be using ‘X’ and the second player will be using ‘Y’. The program should include the following functions: void printDirections ( ) Provides directions on how to play the game int getBoardPosition( int player) This function prompts for the player to input the position of the board and returns the position. void printBoard (char board [ ] ) This function prints the updated board with the input of the player. int isWinner ( char board […
C Program Removing Elements in an Array Make a program that creates an array by asking the size n of the array and n integer inputs. Example: Input size of array: 5 Array elements: 1 2 3 4 5 After creating the array, you need to prompt the user again to pick m number of elements to remove. If the input is invalid, prompt the user to try again. An input is invalid if it meets either one of these criteria: Greater than size n of the array Negative number Example: Number of elements to remove: -2 Invalid number. Try again: 3 After a valid input, prompt the user for the valid indices to remove. An index is valid if it is within the range of the array size. Output the array elements after a valid index input and consider the new size of the array after. Example: Index (1): 2 Array elements: 1 2 4 5 Index (2): 4 Invalid index! Try again. Index (2): 0 Array elements: 2 4 5 Index (3): 2 Array elements: 2 4 After everything, print FINISHED! Input 1. Size of array 2.…
Any loop statement can be used to traverse an array. True or False
True or False. A simple variable, also called a scalar variable, is one that is unrelated to any other variable in the computer’s internal memory. The bubble sort algorithm gets its name from the fact that as the larger values drop to the bottom of the array, the smaller values rise, like bubbles, to the top. Programmers use arrays to temporarily store related data in the internal memory of the computer. Different variables in the same array may have different data types. The elements in an array can be used just like any other variables. When an array is sorted in ascending order, the first element contains the largest value and the last element contains the smallest value. When passing an array by reference in C++, you do not include the address-of operator before the formal parameter’s name in the function header. You distinguish one variable in a one-dimensional array from another variable in the same array using a unique integer,…
A left rotation operation on an array of size shifts each of the array's elements unit to the left. Given an integer, , rotate the array that many steps left and return the result. Example After rotations, . Function Description Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: int d: the amount to rotate by int arr[n]: the array to rotate Returns int[n]: the rotated array Input Format The first line contains two space-separated integers that denote , the number of integers, and , the number of left rotations to perform.The second line contains space-separated integers that describe . Constraints Sample Input 5 4 1 2 3 4 5 Sample Output 5 1 2 3 4 Explanation To perform left rotations, the array undergoes the following sequence of changes: