1. The document describes basic flowcharting concepts including symbols for processes, inputs/outputs, terminals, and decisions. It provides examples of system and program flowcharts. 2. Key elements are defined including start/stop symbols, arrows to show flow, and shapes for processes, inputs, decisions, and other elements. 3. Examples show how to represent simple calculations and conditional logic using flowchart symbols and connections between the elements.

1. Basic
Flowcharting

2. • (Flowcharting)
•
•
•

3. •
•
•
•

4. 1.
2.
3.
4. -
5.
6.

5. •
System Flowchart)
Program Flowchart)

6. 1/3)
•
3
10
10
?

7. (2/3)
•

8. •
(3/3)
–
– -
– -

9. 2
 (System
flowchart)
 (Program
flowchart)

10. (System
•
flowchart)
•
•

11. •
100

12. •
(Program flowchart)
•

13. •
= 0.5 * *
100

14. = 0.5 * *

15. •
•
•
•
•

16. •
(decision table)

17. (1/13)
•
•
American
National Standard Institute (ANSI)

18. (2/13)
START
1.
STOP
2.
read name
(Terminal)
display area 1.
name
2.

19. (3/13)
C=A+B
1. A
Sum = 0
+B
C
(Process) false
2.
i <= 10
true sum
i 0
i

20. (4/13)
print A A
(Document display A , B
)
A,
B

21. (5/13)
read A A = Age
(Comment
)
A
read A
(Manual
Input)

22. (6/13)
for i =1 to 100 i
sum = sum + i 1
1
i
100
(Preparati
on)
sum i

23. (7/13)
write A
A
A
(In-Page
A=3 A
connector)
1

24. (8/13)
read A 1. A
punch B , C
1
2.
(Punch B,C
punch
card) bi b=1 , 1
…n
B1 ,
B2 , Bn
n

25. (9/13)
read ID , ID ,
name
name
(Punched
tape)

26. (10/13)
(Magnatic
disk)

27. (11/13)
findGrade
findGra
(Predefine de
Process)

28. (12/13)
(Auxiliary
Operation)

29. (13/13)
(Communic
ation Link)

30. •
(1/2) START
read age
false
age > 60
true
“You are old”
STOP

31. •
(2/2)
START
sum =
0
i = 1 to 10
sum = sum
+i
i
sum
STOP

32. •
(3/2)
•

33. • (Sequence)
• / /
(Selection/Decision/Condition)
• (Iteration / Loop)

34. (1/3)
•

35. (2/3)
START
A=5 A 5
B=3 B 3
C=A+B A B
print C C
STOP

36. (3/3)
START
A,B
A, B
C=A+B
A B
print C
C
STOP

37. •
1.
--> < >
2. --> <
>
-----------------------------------------------------
:< >
:< >

38. 3.
–
–
4.
– Last_meter
– Curr_meter
– Num_meter
– Electric_fee

39. 5.
1.
2. last_meter curr_meter
3. num_meter = curr_meter –
last_meter
4. electric_fee = num_meter * 2.5
5. num_meter , electric_fee
6.

40. Flow chart
START
Last_meter ,
Curr_meter
Num_meter = Curr_meter – Last_meter
Electric_fee = Num_meter * 2.5
Num_meter , Electric_fee
STOP

41. • (IF - THEN)

42. (1/5)

43. (2/5)
START
read age age
age > 60
false age
true
“You are old”
Y
STOP

44. (3/5)
ans
GoodLuck ans = “GoodLuck”
Welcome Manager Welcome
Manager
Exit
Password System Exit Password
System

45. (4/5)
•
%
•
1.
2.
- =
( 10/100)
3. =

46. (5/5)
START A
read bonus = salary * 3
name ,salary
false Name , salary ,
salary < 5000
bonus
true
salary = salary + (salary*10/100) STOP
A

47. • IF –
THEN

48. IF THEN
BEGIN
;
;
END;

49. IF THEN
ELSE
BEGIN
;
;
END;

50. (1/6)
•

51. (2/6)
• sex =1
False True
Sex = 1
Male
Female = Female + 1 Male = Male +1
• sex =1
Female

52. (3/6)
START
read age age
false true
age > 60 age
“You are young” “You are old”
Yo
Yo
STOP

53. (4/6)
Do you like Pascal
Do you like Pa
ans ans
ans = „y‟ OR ans=„Y‟
ans
I‟m sorry to hear that Thank You
-
Thank you
-
I’m sorry to hear t
Good Bye
Goodbye

54. (5/6)
•
% 5000
5%
•
1.
2. < 5000
- = 10/100
- = 5/100
3. = +( *
)
4. =

55. (6/6)
START A
read salary = salary+(salary * rate)
name ,salary
false true bonus = salary * 3
salary < 5000
rate = 5 / 100 rate = 10 / 100
Name , salary ,
bonus
A STOP

56. (
•
IF)
False True
False True
False True

57. (
IF)
Score = mid + final
false true
Score >=80
false true
Score >=70 Grade = ‘A’
false true
Score >=60 Grade = ‘B’
false true
Score >=50 Grade = ‘C’
Grade = ‘F’ Grade = ‘D’

58. (
•
CASE)

59. (
CASE)
Score = mid + final
score
80..100 70..79 60..69 50..59 0..49
Grade = ‘A’ Grade = ‘B’ Grade = ‘C’ Grade = ‘D’ Grade = ‘F’

60. •
(Controlled Loop)
• (Pre-Test
Condition)
• (Post-
Test Condition)

61. •
Next

62. • N 1 1
5
Next
For N =1 , 5
N
Print N
Next

63. •
False
True

64. • N=1
N <= 5
– N
False
– N 1 N <=5
(N=N+1) True
Print N
• N = N+1

65. •
False
True

66. –
N=1
N
–
N 1
Print N
• N = N+1
N>5
False
N>5
True