Game: Bean Machine Program Plan: Import the required packages into the program. Define a class named “Sample” to simulate the bean machine program. Define function main. Get number of balls to drop from the user and store it into the variable named “numberOfBalls”. Get number of slots from the use and store it into the variable “numberOfSlots”. Define a “for” loop to find the slots values by using “onePath” function. Increment the “slots” array by one at the position of result of “onePath” function. Make a call to the “printHistogram” function by passing the “slots” variable as parameter. Define a function named “onePath” to return the slot position of the ball for a path and also print the path. Define “for” loop to find the path position and path. Find and print the path. Return the position value. Define a function named “printHistogram” to print the histogram for the slots. Find maximum element in slots by using “max” function and store the result into the variable “maxSlotHeight”. Find and print the histogram for the given slots on the screen. Define a function named “max” to get the maximum element in slots. Find the maximum element in given slot and return the result.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7, Problem 7.37PE

Program Plan Intro

Game: Bean Machine

Program Plan:

Import the required packages into the program.

Define a class named “Sample” to simulate the bean machine program.

Define function main.

Get number of balls to drop from the user and store it into the variable named “numberOfBalls”.

Get number of slots from the use and store it into the variable “numberOfSlots”.

Define a “for” loop to find the slots values by using “onePath” function.

Increment the “slots” array by one at the position of result of “onePath” function.

Make a call to the “printHistogram” function by passing the “slots” variable as parameter.

Define a function named “onePath” to return the slot position of the ball for a path and also print the path.

Define “for” loop to find the path position and path.

Find and print the path.

Return the position value.

Define a function named “printHistogram” to print the histogram for the slots.

Find maximum element in slots by using “max” function and store the result into the variable “maxSlotHeight”.

Find and print the histogram for the given slots on the screen.

Define a function named “max” to get the maximum element in slots.

Find the maximum element in given slot and return the result.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Artificial intelligence (Question - 6) ======================= One variation on the game of nim is described in Luger. The game begins with a single pile of stones. The move by a player consists of dividing a pile into two piles that contain an unequal number of stones. For example, if one pile contains six stones, it could be subdivided into piles of five and one, or four and two, but not three and three. The first player who cannot make a move loses the game.(6.1) Draw the complete game tree for this version of Nim if the start state consists of six stones.(6.2) Perform a minimax evaluation for this game. Let 1 denote a win and 0 a loss.

Design Assignment: Texas Hold 'em poker game 2 to 8 human or computer players Each player has a name and stack of chips Computer players have a difficulty setting: easy, medium, hard Summary of each hand: Dealer collects ante from appropriate players, shuffles the deck, and deals each player a hand of 2 cards from the deck. A betting round occurs, followed by dealing 3 shared cards from the deck. As shared cards are dealt, more betting rounds occur, where each player can fold, check, or raise. At the end of a round, if more than one player is remaining, players' hands are compared, and the best hand wins the pot of all chips bet so far. Create the Use Cases for this system Create a Use Case diagram for this system

Computer science Cs 102