Presentation is loading. Please wait.

Presentation is loading. Please wait.

Algorithms 09/04/13. Algorithm Step-by-step process for solving a problem. Often described in pseudocode language. Unambiguous, Executable and Terminating.

Similar presentations


Presentation on theme: "Algorithms 09/04/13. Algorithm Step-by-step process for solving a problem. Often described in pseudocode language. Unambiguous, Executable and Terminating."— Presentation transcript:

1 Algorithms 09/04/13

2 Algorithm Step-by-step process for solving a problem. Often described in pseudocode language. Unambiguous, Executable and Terminating.

3 Input and Output Input is date brought into a process. Output is the result of a process.

4 Piggy Bank Problem Write a program to find the amount of money in a piggy bank. Ask the user for the number of each kind of coin, pennies, nickels, dimes and quarters, then output the answer.

5 Truck Load of Cereal Example Write an algorithm to figure the number of boxes of cereal in a truckload. Let the user provide the weight of a box of cereal in ounces and the number of tons in a truck's payload.

6 Handout Half the class write #1 and the other half write #2


Download ppt "Algorithms 09/04/13. Algorithm Step-by-step process for solving a problem. Often described in pseudocode language. Unambiguous, Executable and Terminating."

Similar presentations


Ads by Google