N D
A
MS
I H
T RT S
OR A
G C H
L
A OW
F L
NAME:RIYA GULIA
CLASS:X ,A
SUBJECT:COMPUTER
SCHOOL:JBPS
ALGORITHMS AND FLOWCHARTS
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
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.
PSEUDOCODE & ALGORITHM
Example 1: Write an algorithm to
determine a student’s final grade
and indicate whether it is passing
or failing. The final grade is
calculated as the average of four
marks.
PSEUDOCODE & ALGORITHM
Pseudocode:
Input a set of 4 marks
Calculate their average by summing and
dividing by 4
if average is below 50
Print “FAIL”
else
Print “PASS”
PSEUDOCODE & ALGORITHM
Detailed Algorithm
Step 1: Input M1,M2,M3,M4
Step 2: GRADE (M1+M2+M3+M4)/4
Step 3: if (GRADE < 50) then
Print “FAIL”
else
Print “PASS”
endif
THE FLOWCHART
(Dictionary)A schematic representation of a
sequence of operations, as in a manufacturing
process or computer program.
(Technical) A graphical representation of the
sequence of operations in an information
system or program. Information system
flowcharts show how data flows from source
documents through the computer to final
distribution to users. Program flowcharts
show the sequence of instructions in a single
program or subroutine. Different symbols are
used to draw each type of flowchart.
THE FLOWCHART
A Flowchart
shows logic of an algorithm
emphasizes individual steps and their
interconnections
e.g. control flow from one action to the next
FLOWCHART SYMBOLS
Name Symbol Use in Flowchart
Oval Denotes the beginning or end of the program
Parallelogram Denotes an input operation
Rectangle Denotes a process to be carried out
e.g. addition, subtraction, division etc.
Diamond Denotes a decision (or branch) to be made.
The program should continue along one of
two routes. (e.g. IF/THEN/ELSE)
Hybrid Denotes an output operation
Flow line Denotes the direction of logic flow in the program
EXAMPLE 1
START
Step 1: Input
START
M1,M2,M3,M4
Input
Input
M1,M2,M3,
M1,M2,M3,
Step 2: GRADE
M4
(M1+M2+M3+M4)/
GRADE(M1+M2+M3+M
GRADE(M1+M2+M3+M
4
4)/4
4)/4
Step 3: if (GRADE
N IS
IS Y
Y <50) then
GRADE<
GRADE<
50
50 Print “FAIL”
PRINT PRINT else
“PASS” “FAIL”
Print “PASS”
endif
STOP
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 30
Print length in cm (LCM)
EXAMPLE 2
FLOWCHART
Algorithm
Step 1: Input Lft START
Step 2: Lcm
Input
Lft x 30 Lft
Step 3: Print
Lcm Lcm Lft x
30
Print
Lcm
STOP
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
EXAMPLE 3
FLOWCHART
START
Algorithm Input
W, L
Step 1: Input W,L
Step 2: AL x W
A LxW
Step 3: Print A
Print
A
STOP
EXAMPLE 4
Write an algorithm and draw a flowchart
that will calculate the roots of a
ax bx c equation
2
quadratic 0
b 2 4ac
Hint: d = sqrt ( ), and the
roots are: x1 = (–b + d)/2a and x2 = (–
b – d)/2a
EXAMPLE 4
Pseudocode:
Input the coefficients (a, b, c) of the
quadratic equation
Calculate d
Calculate x1
Calculate x2
Print x1 and x2
EXAMPLE 4
FLOWCHART
START
Algorithm:
Input
Step 1: Input a, b, c a, b, c
Step 2: d sqrt b( b 4 a c d sqrt(b x b – 4 x a x
) c)
x1 (–b + d) / (2 x a)
Step 3: x1 (–b + d) / (2 x a)
Step 4: x2 (–b – d) / (2 x a) X2 (–b – d) / (2 x a)
Step 5: Print x1, x2 Print
x1 ,x2
STOP
RELATIONAL OPERATORS
Relational Operators
Operator
Description
>
Greater than
<
Less than
=
Equal to
Greater than
THANK
YOU
