ALGORITHMS FLOWCHARTING II.ppt

1、ALGORITHMS & FLOWCHARTING II,LOOPS,Computers are particularly well suited to applications in which operations are repeated many times. If the same task is repeated over and over again a loop can be used to reduce program size and complexity,Example 8: Write an algorithm and draw a flowchart to calcu

2、late 24 .,Algorithm: Step 1: Base 2 Step 2: Product Base Step 3: Product Product * Base Step 4: Product Product * Base Step 5: Product Product * Base Step 6: Print Product,Flowchart,Question: What happens if you want to calculate 2 to the power of 1000? Answer: Use a LOOP (repeated execution of the

3、same set of instructions),Example 9: Write an algorithm and draw a flowchart to calculate 24 using a loop approach? Verify your result by a trace table.,Algorithm:,Step 1: Base 2 Step 2: Power 4 Step 3: Product Base Step 4: Counter 1 Step 5: While Counter PowerRepeat Step 5 through step 7 Step 6: Pr

4、oduct Product * Base Step 7: Counter Counter +1 Step 8: Print Product,TRACING,Example 10: Write down an algorithm and draw a flowchart to find and print the largest of three numbers. Read numbers one by one. Verify your result by a trace table. (Use 5, 7, 3 as the numbers read),Algorithm,Step 1: Inp

5、ut N1 Step 2: Max N1 Step 3: Input N2 Step 4: If (N2Max) thenMax = N2endif Step 5: Input N3 Step 6: If (N3Max) then Max = N3endif Step 7: Print “The largest number is:”,Max,Flowchart & Tracing,N1 N2 N3 Max N2Max N3Max Step1: 5 ? ? ? ? ? Step 2: 5 ? ? 5 ? ? Step 3: 5 7 ? 5 T ? Step 4: 5 7 ? 7 T ? Ste

6、p 5: 5 7 3 7 F F Step 6: 5 7 3 7 F F Step 8: Print Largest Number is 7,Example 11: Write down an algorithm and draw a flowchart to find and print the largest of N (N can be any number) numbers. Read numbers one by one. Verify your result by a trace table. (Assume N to be 5 and the following set to b

7、e the numbers 1 4 2 6 8 ),Algorithm:,Step 1: Input N Step 2: Input Current Step 3: Max Current Step 4: Counter 1 Step 5: While (Counter Max) thenMax Next endif Step 9: Print Max,Tracing,Prob. 1. Write an algorithm and draw a flowchart to print the square of all numbers from LOW to HIGH. Test with LO

8、W=1 and HIGH=10. Prob. 2. Write an algorithm and draw a flowchart to print the SUM of numbers from LOW to HIGH. Test with LOW=3 and HIGH=9. Prob. 3. Write an algorithm and draw a flowchart to print the SUM of numbers from LOW to HIGH. Test with LOW=3 and HIGH=9. Prob. 4. Write an algorithm and draw

9、a flowchart to print all numbers between LOW and HIGH that are divisible by NUMBER. Prob. 5. Write an algorithm and draw a flowchart to print all the prime numbers between LOW and HIGH. Test with LOW=1 and HIGH=100.,Prob. 6. Write an algorithm and draw a flowchart to count and print all numbers from

10、 LOW to HIGH by steps of STEP. Test with LOW=0 and HIGH=100.Prob. 7. Write an algorithm and draw a flowchart to count and print all numbers from HIGH to LOW by steps of STEP. Test with HIGH=100 and LOW=0.Prob. 8. Write an algorithm and draw a flowchart to print the multiplication table for 6s. i.e.

11、 1 6 = 6- 2 6 = 12 - 12 6 = 72,Prob. 9. Write an algorithm and draw a flowchart to print the complete multiplication table for 1s. through 12s. - 1 1 = 1, 1 2 = 2, 1 12 = 12 - 2 1 = 2, 2 2 = 4, 2 12 = 24 - 12 1 = 12, 12 2 = 24, 12 12 = 144Prob. 10. Write an algorithm and draw a flowchart to arrange

12、 N values read from the input in ascending order. Prob. 11. Write an algorithm and draw a flowchart that will find and print the product of 3 numbers.,Prob. 12. Write an algorithm and draw a flowchart that will find and print The factorial of NUMBER is FACTORIAL. Test the flowchart for NUMBER=5.Prob. 13. Write an algorithm and draw a flowchart that will find and print the number of vowels in a given set of characters and print there number of occurrences.,