Scribd
Upload
130 views

Algorithms and Flowcharts 2

The document discusses loops and flowcharting algorithms that involve repetition. It provides 13 examples of algorithms that use loops to calculate powers, find the largest number among inputs, and perform other repetitive tasks. For each algorithm, it shows the steps, a corresponding flowchart, and sometimes a trace table to verify the results. It explains that loops allow reducing the size and complexity of programs when the same operations are repeated multiple times.

Uploaded by

Ayaz Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
130 views

Algorithms and Flowcharts 2

The document discusses loops and flowcharting algorithms that involve repetition. It provides 13 examples of algorithms that use loops to calculate powers, find the largest number among inputs, and perform other repetitive tasks. For each algorithm, it shows the steps, a corresponding flowchart, and sometimes a trace table to verify the results. It explains that loops allow reducing the size and complexity of programs when the same operations are repeated multiple times.

Uploaded by

Ayaz Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

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 calculate 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
START

Base2
Product Base
Product Product * Base
Product Product * Base
Product Product * Base
Print
Product

STOP

Question: What happens if you want to

calculate 2 to the power of 1000?


Answer: Use a LOOP (repeated
execution of the 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:
Base 2
Power 4
Product Base
Counter 1
While Counter < Power
Repeat Step 5 through step 7
Step 6: Product Product * Base
Step 7: Counter Counter +1
Step 8: Print Product
Step 1:
Step 2:
Step 3:
Step 4:
Step 5:

START

Base 2
Power 4
Product Base
Counter 1

is
Counter < Power

Y
Product Product * Base
Counter Counter + 1

Print
Product

STOP

TRACING
BASE POWER PRODUCT COUNTER COUNTER < POWER
STEP 1:
STEP 2:
STEP 3:
STEP 4:
STEP 5:
STEP 6:
STEP 7:
STEP 5:
STEP 6:
STEP 7:
STEP 5:
STEP 6:
STEP 7:
STEP 5:

2
2
2
2
2
2
2
2
2
2
2
2
2
2

STEP 8:

print

?
4
4
4
4
4
4
4
4
4
4
4
4
4

16.

?
?
2
2
2
2x2=4
4
4
4x2=8
8
8
8x2=16
16
16

?
?
?
1
1
1
1+1=2
2
2
2+1=3
3
3
3+1=4
4

?
?
?
T
T
T
T
T
T
T
T
T
F
F

Step 1:

Base 2

Step 2: Power 4
Step 3:

Product Base

Step 4: Counter 1
Step 5: While Counter < Power
Repeat Step 5 through
step 7
Step 6: Product Product *
Base
Step 7: Counter Counter +1
Step 8: Print Product

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:
Step 2:
Step 3:
Step 4:

Step 5:
Step 6:

Step 7:

Input N1
Max N1
Input N2
If (N2>Max) then
Max = N2
endif
Input N3
If (N3>Max) then
Max = N3
endif
Print The largest number is:,Max

Flowchart &
Tracing
N1

N2

N3

Max N2>Max N3>Max

Step1:

Step 2:

Step 3:

Step 4:

Step 5:

Step 6:

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
be the numbers {1 4 2 6 8 })

Algorithm:

Step 1:
Step 2:
Step 3:
Step 4:
Step 5:

Step 6:
Step 7:
Step 8:

Step 9:

Input N
Input Current
Max Current
Counter 1
While (Counter < N)
Repeat steps 5 through 8
Counter Counter + 1
Input Next
If (Next > Max) then
Max Next
endif
Print Max

START
Input
N, Current

Max Current
Counter 1

Counter < N

Print
Max

Counter Counter +1

Input
Next

STOP
Next
>Max
Y
Max Next

Tracing
Step 1
Step 2
Step 3
Step 4
Step 5
Step 6
Step 7
Step 8
Step 5
Step 6
Step 7
Step 8
Step 5
Step 6
Step 7
Step 8
Step 5
Step 6
Step 7
Step 8
Step 5
Step 9

Current

Max

Counter

Counter < N

Next

Next > Max

5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

1
1
1
1
1
4
4
4
4
4
4
4
4
6
6
6
6
8
8

1
1
2
2
2
2
3
3
3
3
4
4
4
4
5
5
5
5

T
T
T
T
T
T
T
T
T
T
T
T
T
T
F
F
F
F

4
4
4
4
2
2
2
2
6
6
6
6
8
8
8

T
F
F
F
F
F
F
T
T
F
F
T
T
F

8 output

Prob. 1. Write an algorithm and draw a flowchart to


print the square of all numbers from LOW to HIGH.
Test with LOW=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 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 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 6's. i.e.
---- 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 1's. through
12's.

---- 1 1 = 1, 1 2 = 2,
---- 2 1 = 2, 2 2 = 4,

---- 12 1 = 12, 12 2 = 24,

1 12 = 12
2 12 = 24
12 12 = 144

Prob. 10. Write an algorithm and draw a flowchart to


arrange 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.

You might also like