INTRODUCTION TO PROGRAMMING, ALGORITHMS & FLOWCHARTS Programming in C2 CHAPTER 1.
Introduction to Flowcharts
description
Transcript of Introduction to Flowcharts
![Page 1: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/1.jpg)
Introduction to Flowcharts
1
![Page 2: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/2.jpg)
Program Designing techniques
Pseudocode AlgorithmFlowchart
2
![Page 3: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/3.jpg)
Designing techniques
A typical programming task can be divided into two phases:
Problem solving phase produce an ordered sequence of steps that
describe solution of problem this sequence of steps is called an algorithm
Implementation phase implement the program in some programming
language
3
![Page 4: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/4.jpg)
Steps in Problem Solving
First produce a general algorithm (one can use pseudocode)
Refine the algorithm successively to get step by step detailed algorithm that is very close to a computer language.
Pseudocode is an artificial and informal language that helps programmers develop algorithms.
Pseudocode is very similar to everyday English.
4
![Page 5: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/5.jpg)
Pseudocode & Algorithm
Example 1: Write a pseudocode and an algorithm to convert the length in feet to inches.
5
![Page 6: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/6.jpg)
Example 2
Pseudocode: Input the length in feetCalculate the length in inches by
multiplying length in feet with 12Print length in inches.
6
![Page 7: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/7.jpg)
Example 2
Algorithm Step 1: Input L_ftStep 2: L_inches L_ft x 12Step 3: Print L_inches
7
![Page 8: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/8.jpg)
The FlowchartA schematic representation of a sequence of
operations, as in a manufacturing process or computer program.
It is a graphic representation of how a process works, showing, at a minimum, the sequence of steps.
A flowchart consists of a sequence of instructions linked together by arrows to show the order in which the instructions must be carried out.
8
![Page 9: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/9.jpg)
Cont…
Each instruction is put into a box. The boxes are different shapes depending upon what the instruction is.
Different symbols are used to draw each type of flowchart.
9
![Page 10: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/10.jpg)
Cont…
A Flowchartshows logic of an algorithmemphasizes individual steps and their
interconnectionse.g. control flow from one action to the next
10
![Page 11: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/11.jpg)
Flowchart Symbols
Basic
Oval
Parallelogram
Rectangle
Diamond
Hybrid
Name Symbol Use in Flowchart
Denotes the beginning or end of the program
Denotes an input operation
Denotes an output operation
Denotes a decision (or branch) to be made. The program should continue along one of two routes. (e.g. IF/THEN/ELSE)
Denotes a process to be carried oute.g. addition, subtraction, division etc.
Flow line Denotes the direction of logic flow in the program
11
![Page 12: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/12.jpg)
Example 2
Write an algorithm and draw a flowchart to convert the length in feet to centimeter.
Pseudocode: Input the length in feet (Lft)Calculate the length in cm (Lcm) by
multiplying LFT with 30Print length in cm (LCM)
12
![Page 13: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/13.jpg)
Example 2
Algorithm Step 1: Input L_ftStep 2: Lcm L_ft x 30 Step 3: Print L_cm
START
InputL_ft
Lcm L_ft x 30
PrintL_cm
STOP
Flowchart
13
![Page 14: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/14.jpg)
Example 3
Write an algorithm and draw a flowchart that will read the two sides of a rectangle and calculate its area.
Pseudocode Input the width (W) and Length (L) of a
rectangle Calculate the area (A) by multiplying L with W Print A
14
![Page 15: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/15.jpg)
Example 3
Algorithm Step 1: Input W,LStep 2: A L x W Step 3: Print A
START
InputW, L
A L x W
PrintA
STOP
15
![Page 16: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/16.jpg)
Example 4
Write an algorithm and draw a flowchart that will calculate the roots of a quadratic equation
Hint: d = sqrt ( ), and the roots are: x1 = (–b + d)/2a and x2 = (–b – d)/2a
2 0ax bx c
2 4b ac
16
![Page 17: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/17.jpg)
Example 4
Pseudocode: Input the coefficients (a, b, c) of the
quadratic equationCalculate dCalculate x1Calculate x2Print x1 and x2
17
![Page 18: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/18.jpg)
Example 4
Algorithm: Step 1: Input a, b, c Step 2: d sqrt ( ) Step 3: x1 (–b + d) / (2 x a) Step 4: x2 (–b – d) / (2 x a) Step 5: Print x1, x2
START
Inputa, b, c
d sqrt(b x b – 4 x a x c)
Printx1 ,x2
STOP
x1 (–b + d) / (2 x a)
X2 (–b – d) / (2 x a)
4b b a c
18
![Page 19: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/19.jpg)
Decision Structures
The expression A>B is a logical expression it describes a condition we want to test if A>B is true (if A is greater than B) we take
the action on left print the value of A if A>B is false (if A is not greater than B) we
take the action on right print the value of B
19
![Page 20: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/20.jpg)
Decision Structures
isA>B
Print B
Print A
Y N
20
![Page 21: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/21.jpg)
IF–THEN–ELSE STRUCTURE
The structure is as follows
If condition then
true alternative
else
false alternative
endif
21
![Page 22: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/22.jpg)
IF–THEN–ELSE STRUCTURE
If A>B then print A
else print B
endif
isA>B
Print B
Print A
Y N
22
![Page 23: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/23.jpg)
Relational Operators
Relational Operators
Operator Description> Greater than
< Less than
= Equal to
Greater than or equal to
Less than or equal to
Not equal to
23
![Page 24: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/24.jpg)
Example 5
Write an algorithm that reads two values, determines the largest value and prints the largest value with an identifying message.
ALGORITHMStep 1: Input VALUE1, VALUE2Step 2: if (VALUE1 > VALUE2) then
MAX VALUE1else
MAX VALUE2endif
Step 3: Print “The largest value is”, MAX
24
![Page 25: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/25.jpg)
Example 5
MAX VALUE1
Print“The largest value is”,
MAX
STOP
Y N
START
InputVALUE1,VALUE2
MAX VALUE2
isVALUE1>VALUE2
25
![Page 26: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/26.jpg)
NESTED IFS
One of the alternatives within an IF–THEN–ELSE statementmay involve further IF–THEN–ELSE
statement
26
![Page 27: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/27.jpg)
Example 6
Write an algorithm that reads three numbers and prints the value of the largest number.
27
![Page 28: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/28.jpg)
Example 6
Step 1: Input N1, N2, N3Step 2: if (N1>N2) then
if (N1>N3) then MAX N1 [N1>N2, N1>N3]
else MAX N3 [N3>N1>N2]
endifelse
if (N2>N3) then MAX N2 [N2>N1, N2>N3]
else MAX N3 [N3>N2>N1]
endifendif
Step 3: Print “The largest number is”, MAX
28
![Page 29: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/29.jpg)
Example 6
Flowchart: Draw the flowchart of the above Algorithm.
29
![Page 30: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/30.jpg)
Flowchart
NO
30
![Page 31: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/31.jpg)
Example 7
Write and algorithm and draw a flowchart to read an employee name (NAME), overtime hours worked (OVERTIME), hours absent (ABSENT) and determine the bonus payment (PAYMENT).
31
![Page 32: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/32.jpg)
Example 7
Bonus Schedule
OVERTIME – (2/3)*ABSENT
Bonus Paid
>40 hours>30 but 40 hours>20 but 30 hours>10 but 20 hours 10 hours
$50$40$30$20$10
32
![Page 33: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/33.jpg)
Step 1: Input NAME,OVERTIME,ABSENTStep 2: if (OVERTIME–(2/3)*ABSENT > 40 ) then PAYMENT 50 else if (OVERTIME–(2/3)*ABSENT > 30 && OVERTIME–(2/3)*ABSENT<= 40 ) then
PAYMENT 40 else if (OVERTIME–(2/3)*ABSENT > 20 &&
OVERTIME–(2/3)*ABSENT<= 30 ) then PAYMENT 30
Algorithm
33
![Page 34: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/34.jpg)
else if (OVERTIME–(2/3)*ABSENT > 10 &&OVERTIME–(2/3)*ABSENT<= 20) then
PAYMENT 20 else PAYMENT 10 endif
Step 3: Print “Bonus for”, NAME “is $”, PAYMENT
34
![Page 35: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/35.jpg)
Example 7
Flowchart: Draw the flowchart of the above algorithm?
35
![Page 36: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/36.jpg)
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
36
![Page 37: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/37.jpg)
Flowchart for finding the sum of first five natural numbers
( i.e. 1,2,3,4,5):
Example 8:
37
![Page 38: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/38.jpg)
Example 9
Flowchart to find the sum of first 50 natural numbers.
38
![Page 39: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/39.jpg)
Example 10
Write down an algorithm and draw a flowchart to find and print the largest of N (N can be any number) numbers. (Assume N to be 5 and the following set to be the numbers {1 4 2 6 8 })
39
![Page 40: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/40.jpg)
Algorithm:
Step 1: Input N Step 2: Input Current Step 3: Max Current Step 4: Counter 1 Step 5: While (Counter < N)
Repeat steps 5 through 8 Step 6: Counter Counter + 1 Step 7: Input Next Step 8: If (Next > Max) then
Max Next endif
Step 9: Print Max
40
![Page 41: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/41.jpg)
START
InputN, Current
Max Current
PrintMax
STOP
Y
Counter < NN
Counter 1
Counter Counter +1
InputNext
Next >Max
Y
N
Max Next
Flowchart
41
![Page 42: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/42.jpg)
END
42
![Page 43: Introduction to Flowcharts](https://reader036.fdocuments.net/reader036/viewer/2022081415/568157f3550346895dc57012/html5/thumbnails/43.jpg)
43
Write an algorithm and draw a flowchart about students grades as follows:
score Grades
Score >=90 A
Score >=80 and Score < 90Score >=70 and Score < 80Score >=60 and Score < 70Score < 60
BCDFail