subject

Write a program that evaluates the random distribution of a dice. The game should first prompt the client for a number of die throws that he would like. The game then throws the die that many times. The game records the number of times each die number appears on top and calculates the average for the six values. The program then computes the percent difference between the average and the number for each die face value. Use at least three methods: One for input, one for processing and one for output. Allow the client to repeat the game as many times as she wishes. A sample run of the game would look like this: This game requests a number from the player.
The game then throws the die that number of times.
The game then displays the percentage difference between the number for each die face value and the average
Please enter the number of times that you would like the computer to throw the dice.

The number of throws is 1200 with the average of 200.
The percentage from the average for each diece number is:
Dice number 1 landed 206 times and is 3% above the average.
Dice number 2 landed 204 times and is 2% above the average.
Dice number 3 landed 194 times and is 3% below the average.
Dice number 4 landed 192 times and is 4% below the average.
Dice number 5 landed 193 times and is 3.5% below the average.
Dice number 6 landed 211 times and is 5.5% above the average.

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 24.06.2019 20:00
Individuals suffering from technology overload feel distressed when deprived of computers and mobile devices.true/fasle
Answers: 2
question
Computers and Technology, 25.06.2019 00:30
Which of these serves as a bridge between the programming team and the audio team?
Answers: 2
question
Computers and Technology, 25.06.2019 08:00
Astrategy for speeding up hard drive performance is
Answers: 2
question
Computers and Technology, 25.06.2019 08:50
1. define independent-set as the problem that takes a graph g and an integer k and asks whether g contains an independent set of vertices of size k. that is, g contains a set i of vertices of size k such that, for any v and w in i, there is no edge (v,w) in g. show that independent-set is np-complete.
Answers: 3
You know the right answer?
Write a program that evaluates the random distribution of a dice. The game should first prompt the c...
Questions
question
Mathematics, 19.03.2021 20:20
question
Mathematics, 19.03.2021 20:20
question
Mathematics, 19.03.2021 20:20
question
Mathematics, 19.03.2021 20:20
Questions on the website: 13722361