Program to compute distance travelled by ball, C/C++ Programming

Assignment Help:

Produce a pseudo code to be used for development compute and display some data on the bounces a ball will make when dropped from a given height.

To simplify the problem, you assume the ball bounces in place; that is, it remains bouncing on the same spot and does not have any forward motion. The program will prompt the user for the initial height of the ball, the number of bounces to consider, and the ball's elasticity (which must lie between 0 and 1). It will compute the height of each bounce based on the initial height and the elasticity of the ball, and display it. The program will also compute the total distance travelled, which is the sum of the up and down bounces, for the given number of bounces, and display it. The program will repeat this process until the user tells it to stop.

If the ball is at height h, when it bounces, it reaches new height h', which is computed by the formula

h' = h ´ resilience

where resilience is expressed as the elasticity coefficient raised to the nth power, if n is the bounce number:

resilience = elasticityn

If the original height is H, then the first bounce height will be

h   = H ´ elasticity

With elasticity in the range between 0 and 1, each bounce will be smaller than the preceding one, but never become 0. We will therefore stop the program after a specified number of bounces.

The ball will travel the distance shown bellow (where the elasticity is 0.8) which we have drawn to help you. We have represented a forward motion for the sake of clarity (the ball bounces on the same spot).

1362_distance travel by ball as it bounce.png

Each time the ball bounces, it travels twice the height of the bounce, so the total distance travelled is

H + 2h   + 2h   + 2h   + 2h

+ ...

1

2

3

4





The user will be prompted for the initial height in this way:

Give the height in inches from which the ball is dropped:

Then the user will be asked the number of bounces:

Give  the  number  of  times  the  ball  will  bounce:

And finally the user will be asked the elasticity of the ball:

Give  the  elasticity  of  the  ball  (between  0  and  1):

For each bounce the program will display the following:

On bounce 9 the ball rises to a height of 99.9 inches.

After the last bounce the program will display the following:

The total distance travelled by a ball with an elasticity of 0.999 when dropped from a height of 99.9 inches and after bouncing 9 times is 999 inches.

The user will be asked if the program is to continue:

Another try?

 b.  Amend your formulae to calculate until bounce height becomes less than 1 inch and produce number of bounces.


Related Discussions:- Program to compute distance travelled by ball

Padovan stringf, A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation.

Compiler design, Compiler Design - Limit In The Method Instructions

Compiler Design - Limit In The Method Instructions

Custom scans and alerts think or swim, Custom Scans and Alerts Think or Swi...

Custom Scans and Alerts Think or Swim Project Description: I am seeking somebody to make me several Custom Scans and Alerts on Thinkorswim TOS Skills required are C++ Prog

Implement a binomial tree class, a) Implement a binomial tree class with a ...

a) Implement a binomial tree class with a method that calculates the value of an option passed in to the class. The binomial tree should not rely on specific features of the differ

Compiler design limiting instruction, Ravi is a newbie to the programming a...

Ravi is a newbie to the programming and while learning the programming language he came to know the following rules: · Each program must start with ''''{'''' and end with ''''}

Char, how many bytes required to char

how many bytes required to char

Describe how can i allocate/unallocate an array of things?, A: Use p = new ...

A: Use p = new T[n] and delete[] p:   Fred* p = new Fred[100]; ... delete[] p; Any time you allocate an array of objects through new (generally with the [n] in the n

Algorithm, Write an algorithm to print all even numbers in descending order...

Write an algorithm to print all even numbers in descending order and draw the flowchart.

Problem : Luminous Jewels - Polishing Necklace, Byteland county is very fam...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Board coloring, color representation 0,1,2,3,4,5,6,7...

color representation 0,1,2,3,4,5,6,7...

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd