!
"#$%&'()*
and
+"$,-(!%'*
Reading
and
Assignment
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
Example
START
Step 1: Input M1,M2,M3,M4
Step 2: GRADE ¬ (M1+M2+M3+M4)/4
Input
M1,M2,M3,M4
Step 3: if (GRADE <50) then
Print “FAIL”
else
GRADE¬(M1+M2+M3+M4)/4 Print “PASS”
endif
N Y
IS
GRADE
<50
Print “Pass”
PRINT Print “FAIL”
PRINT
“PASS” “FAIL”
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
Algorithm
Flowchart
• Step 1: Input Lft
START
• Step 2: Lcm ¬ Lft x 30
• Step 3: Print Lcm Input
Lft
Lcm ¬ Lft x 30
PrintPrint
LCM
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
Algorithm
START
• Step 1: Input W,L
• Step 2: A¬L x W Input
W, L
• Step 3: Print A
A¬LxW
print
Printa
A
STOP
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
DECISION STRUCTURES
Y N
is
A>B
Print A Print B
Print Print
A B
IF–THEN–ELSE STRUCTURE
• The structure is as follows
If condition then
true alternative
else
false alternative
endif
IF–THEN–ELSE STRUCTURE
• The algorithm for the flowchart is as follows:
If A>B then
print A
else
print B Y N
is
endif A>B
Print
Print A Print
Print B
A B
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
Example 5
• Write an algorithm that reads two values, determines the
largest value and prints the largest value with an identifying
message.
ALGORITHM
Step 1: Input VALUE1, VALUE2
Step 2: if (VALUE1 > VALUE2) then
MAX ¬ VALUE1
else
MAX ¬ VALUE2
endif
Step 3: Print “The largest value is”, MAX
Example 5
START
Input
VALUE1,VALUE2
Y is
N
VALUE1>VALUE2
MAX ! VALUE1 MAX ! VALUE2
Pint “largestPrintvalue is “, max
“The largest value is”,
MAX
STOP
NESTED IFS
• One of the alternatives within an IF–THEN–ELSE statement
• may involve further IF–THEN–ELSE statement
Example 6
• Write an algorithm that reads three numbers and prints the value of
the largest number.
Example 6
Step 1: Input N1, N2, N3
Step 2: if (N1>N2) then
if (N1>N3) then
MAX ¬ N1 [N1>N2, N1>N3]
else
MAX ¬ N3 [N3>N1>N2]
endif
else
if (N2>N3) then
MAX ¬ N2 [N2>N1, N2>N3]
else
MAX ¬ N3 [N3>N2>N1]
endif
endif
Step 3: Print “The largest number is”, MAX
Example 6
• Flowchart: Draw the flowchart of the above Algorithm.
Loop
• A loop is a series of commands that will continue to repeat over and
over again until a condition is met. For example, you want print your
names for five times. Instead of keep five output statement you can
have loop statement and one input statement
Algorithm to print your name for five times
• Step 1 : count=1
• Step 2: while (count <=5)
• 2.a print “yourname”
• 2.b count=count+1
• [end of while]
Flowcharts to print your name 5 times
Start
Count=1
no
Count <=5
yes
Start Print “your name”
Count = count+1
Exercise on loop
• Write an algorithm and draw a flowchart to print 1 to 100 using loop
• Write an algorithm and draw a flowchart to print all even number
between 50 to 100 using loop
• Write an algorithm and draw a flowchart to print 40 to 10 in reverse
order using loop (40 39 38…………………..10)
Some important terms
• Variable : A variable is a storage location and an associated symbolic
name (an identifier) which contains some known or unknown quantity or
information, a value. The variable name is the usual way to reference the
stored value.
• Subroutine :a subroutine is a sequence of program instructions that
perform a specific task, packaged as a unit. This unit can then be used in
programs wherever that particular task should be performed.
Subprograms may be defined within programs, or separately
in libraries that can be used by multiple programs.
