Algorithms
and
Flowcharts
Ankita Agarwal
Algorithms
2 Presentation title 20XX
3
The algorithms is:
FD 4
LT 90
FD 2
RT 90
FD 3
LT 90
FD 5
LT 90
FD 7
4
Flowcharts
and
pseudocode
Pseudocode
6 Presentation title 20XX
Example
7 Presentation title 20XX
FLOWCHA
RT
PSEUDOC
ODE
8 Presentation title 20XX
9 Presentation title 20XX
Example
A program needs to ask a person’s age, then tell
them how old they will be in 50years
10 Presentation title 20XX
Example
A program needs to ask a person’s age, then tell
them how old they will be in 50years
11 Presentation title 20XX
Decisions
Flowchart
13 Presentation title 20XX
Pseudocode
14 Presentation title 20XX
CASE…..ENDCASE
15
Loops
17 Presentation title 20XX
18
19
20
Condition controlled- REPEAT
UNTIL Loop
Condition controlled- While Loop
An algorithm needs to continually ask the
user to input numbers, and add them to a
total, until the total marks is more than 100,
then output the total.
23 Presentation title 20XX
Nested
Constru
ct
24 Presentation title 20XX
25 Presentation title 20XX
String Manipulation
26 Presentation title 20XX
27 Presentation title 20XX
Convert the flowchart into
pseudocode. Replace the Loop with a
For Loop (from 0 to wordlength) but
it needs to add 2 each time.
28 Presentation title 20XX
Subrouti
nes
29 Presentation title 20XX
30 Presentation title 20XX
31 Presentation title 20XX
32 Presentation title 20XX
33 Presentation title 20XX
34 Presentation title 20XX
35 Presentation title 20XX
36 Presentation title 20XX
