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

C program for diviser, C Program for DIVISER   void main() {  ...

C Program for DIVISER   void main() {           int result,number,min;           clrscr();           printf("ENTER THE NUMBER=");           flushall();

How can I fix this to, Write a program consisting of two functions (plus ma...

Write a program consisting of two functions (plus main). The first function should read in a number and then pass this back to main. This value should then be passed into a secon

Sentence, Consider text comprised of sentences and sentences comprised of w...

Consider text comprised of sentences and sentences comprised of words. Words in a sentence will be space delimited. Given a text and K strings, task is to find out the number valid

How to write program, how to write a program for all the types of beam reac...

how to write a program for all the types of beam reactions

Data structure, Project Description: Project is related indexing data re...

Project Description: Project is related indexing data related some data structure. I need to share all information related project later if i contact any body Skills required

C/c++ program, luminous jewel polishing necklace,c/c++ programming

luminous jewel polishing necklace,c/c++ programming

What is the best fit algorithm, The Best fit algorithm: The best fit metho...

The Best fit algorithm: The best fit method occurs the smallest free block whose size is greater than or equivalent to n. An algorithm to get such a block by traversing the whole

ASCII, A string S is said to be "Super ASCII", if it contains the character...

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''''a''''-''''z'''') and

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