Chapter

3
Introduction to
Problem-Solving
 Sectio
ns
• 0.1. Problem-Solving & Computer Science
• 0.2. Program Design & Problem-Solving Techniques
• 0.3. Steps in Program Development
• 0.4. Algorithms, Pseudocode, & Flowcharts
• 0.5. Decision Structures

Examples 2
 Exampl
es
• Example 1: Road Example
• Example 2: Area of a Rectangle Calculator
• Example 3: Simple Calculator
• Example 4: Determining a Student’s Final Grade
• Example 5: Converting The Length
• Example 6: Area of a Rectangle Calculator
• Example 7: Determining The Largest Value

3
 Objectiv
• esis, and why it is important (0.1).
To explain what problem solving
• To understand how to write algorithms (0.1–0.5).
• To describe how a program can be designed (0.2–0.3).
• To describe algorithms in different forms (0.4).
• To understand the difference between algorithms and pseudocode (0.4).
• To draw program flowcharts (0.4-0.5).
• To understand decision Structures (0.5).

4
 0.1. Problem-Solving &
Computer
Science
 What is Computer Science?
 Example 1: Road Example
 Algorithms
 Example 2: Area of a Rectangle
Calculator

5
 What is Computer
Science?
• Computer Science can be summarized with two simple
words:
problem solving.
• Computer Science is the study of problems, problem-solving, and
the solutions that come out of this problem-solving process.
• Given a problem, the goal is to develop an algorithm to solve the
problem.
• An algorithm is a step-by-step list of instructions to solve
the
problem.

0.1 6
 Road Example
Example 1
Imagine that you have the following
image, which is a map of a road
leading to the building shown in the
picture.
• There are a car and trees.
• The car cannot cross the trees.
• The road is divided into squares to
calculate the steps of the car.
• Each square is considered as one
step.

How can the car arrive at the

building?
0.1 Example 1 7
 Road
Example
•
•
Solution
Step 1: Move to the right three steps.
Step 2: Move to down two steps.
• Astep.
Step 3: Move to the left one
• Step 4: Move to down two steps.
• Step 5: Move to the right one step.
• Step 6: Move to down one step. Step 1 Step 2

Step 3 Step 4 Step 5 Step 6

0.1 Example 1 8
 Road
Example
Solution
• Step 1: Move to down four steps.
• Step 2: Move to the rightBthree steps.
• Step 3: Move to down one step.

Step 1 Step 2 Step 3

0.1 Example 1 9
 Road Example
Different Solutions
• As we can see that Solution A and Solution B are both correct
solutions to the same problem, but there are differences in
the complexity and efficiency of the solutions.
• The cost of Solution A is 10 steps while Solution B is 8 steps, so we
consider Solution B as a better solution based on the number
of steps.
• Reducing the number of steps in the previous example means
reducing the amount of fuel needed by the vehicle and speeding
up the arrival time.

0.1 Example 1 10
 Algorithms
• An algorithm is a set of obvious, logical, and
sequential steps that solve a specific problem.
• To put it simply, the algorithm is like a recipe for preparing
a specific food.
• Following the steps of the algorithm will end up
solving the problem.

0.1 11
 Area of a Rectangle
Calculator
Write an algorithmExample 2 the area of a
that can calculate
rectangle. The width and the height of the rectangle
should be taken from the user.
Note:
Area = Width × Height

0.1 Example 2 12
 Area of a Rectangle
Calculator
Solution A – Good: Solution A
1. Ask the user to enter Width
2. Ask the user to enter Height
3. Set Area to (Width × Height)
4. Display Area for the user

• As you can see in this solution, we have described the steps that are
going to solve the problem.
• You can describe the steps in your own way, but your description of
the steps should be obvious, logical, and sequential.

0.1 Example 2 13
 Area of a Rectangle
Calculator
Solution B - Bad: Solution B
1. Ask the user to enter Width
2. Ask the user to enter Height
3. Calculate Area
4. Display Area for the user

The reason for considering Solution B as a bad solution:

• Step 3 is not clear because it does not explain how we can calculate
Area.
• So, this algorithm is bad because its steps are not obvious.

0.1 Example 2 14
 Area of a Rectangle
Calculator
Solution C - Bad: Solution C
1. Set Area to (Width × Height)
2. Ask the user to enter Width
3. Ask the user to enter Height
4. Display Area for the user
The reasons for considering Solution C as a bad solution:
• We don't know what Width and Height at the Step 1 are. In other words, Width and
Height have not been defined before Step 1, so we cannot use them because they
do not exist yet.
• What about Step 2 and Step 3? Width and Height are defined there!. After Step 2,
Width does exist, but Height does not. After Step 3, Height does exist. Both Width
and Height are available to be used at or after step 4.
• So, this algorithm is bad because its steps are not correctly sequential.

0.1 Example 2 15
 Area of a Rectangle
Calculator
Solution D - Bad: Solution D
1. Set Area to (Width × Height)
2. Display Area for the user

The reasons for considering Solution D as a bad solution:

• Step 1 tells us to multiply Width and Height, but we don't know
what Width and Height are. Even, they have not been defined in
any steps of the algorithm.
• So, this algorithm is bad because of the illogical step, which is using
unknown things (Width and Height).

0.1 Example 2 16
 Area of a Rectangle
Calculator
Solution E - Bad: Solution E
1. Ask the user to enter Width
2. Ask the user to enter Height
3. Set Area to (Width × Height × 2)
4. Display Area for the user
The reasons for considering Solution E as a bad solution:
• This algorithm will give us a wrong value of the Area. For example, suppose that the
user entered 4 for Width and 5 for Height. The correct value of the Area should be
20, but this algorithm will display 40 as the value of the Area.
• The reason for giving the wrong value is how Step 3 calculates the Area. Step 3
calculates the Area by the incorrect equation (Width × Height × 2) instead of
(Width × Height).
• So, this algorithm is bad because it has a logical problem, which is producing incorrect
output (the value of the Area).
0.1 Example 2 17
 0.2. Program
Design & Problem-
Solving Techniques
 How Do We Write a
Program?
 Problem-Solving Phase
 Implementation Phase

18
 How Do We Write a
Program?
• A Computer is not intelligent.
◦ It cannot analyze a problem and come up with a solution.
◦ A human (the programmer) must analyze the problem, develop the
instructions for solving the problem, and then have the computer carry
out the instructions.
• To write a program for a computer to follow, we must go through a
two-phase process: problem solving and implementation.

0.2 19
 Problem-Solving
1. Analysis andPhase
Specification - Understand (define) the problem and
what the solution must do.

2. General Solution (Algorithm) - Specify the required data types and

the logical sequences of steps that solve the problem.

3. Verify - Follow the steps exactly to see if the solution really does
solve the problem.

0.2 20
 Implementation
Phase
• Concrete Solution (Program) - Translate the algorithm (the general
solution) into a programming language.
• Test - Have the computer follow the instructions.
◦ Then manually check the results.
◦ If you find errors, analyze the program and the algorithm to determine the
source of the errors, and then make corrections.
• Once a program is tested, it enters into next phase (Maintenance).
• Maintenance requires modification of the program to meet
changing requirements or to correct any errors that show up
while using it.

0.2 21
 0.3. Steps in Program
Development
 Example 3: Simple
Calculator

22
 Steps in Program
Development
1. Define the problem into three separate components:
• Inputs
• Processing steps to produce required outputs.
• Outputs

0.3 23
 Steps in Program
Development
2. Outline the solution.
• Decompose the problem to smaller steps.
• Establish a solution outline.

3. Develop the outline into an algorithm.

• The solution outline is now expanded into an algorithm.

0.3 24
 Steps in Program
Development
4. Test the algorithm for correctness.
• Very important in the development of a program, but
often forgotten.
• Major logic errors can be detected and corrected at an early stage.

5. Code the algorithm into a specific programming language.

0.3 25
 Steps in Program
Development
6. Run the program on the computer.
• This step uses a program interpreter, and
programmer-designed
compiler or test data to machine-test the code for
• Syntax errors
• Runtime errors
• Logic errors

7. Document and maintain the program.

0.3 26
 Simple
Calculator
Suppose that you areExample
asked to write a3calculator program
that can sum and subtract two integer numbers. Write the
program requirements, specifications and algorithm.

0.3 Example 3 27
 Simple
Calculator
Suppose that you areTheasked to write a calculator program that can sum
and subtract two integer numbers. Write the program requirements,
Requirements
specifications and algorithm.
The requirements:
◦ The user can enter an equation which consists of two numbers and a sign (- or
+).
◦ The program should calculate the equation correctly and display the result for
the user.
◦ The program can sum and subtract two integer numbers.

0.3 Example 3 28
 Simple
Calculator
Suppose that you areTheasked to write a calculator program that can sum
and subtract two integer numbers. Write the program requirements,
Specifications
specifications and algorithm.
The specifications:
◦ When the program runs, it will display a welcome message that says, 'Welcome
to our Calculator".
◦ The program will then ask the user to enter the first number.
◦ The program will then ask the user to enter the second number.
◦ The program will then ask the user to select the sign (calculation operators)
from this set (-,+).
◦ The program will then display the correct result of the calculation on the screen
and end.

0.3 Example 3 29
 Simple Calculator
Designing a
• After the stepsSolution
of identifying the problem (the requirements and
specifications), we should have a clear idea about what is
going exactly to be achieved and solved.
• In this step, we are going to describe how the specifications can be
achieved.
• This means that we need to design an algorithm that fulfills
the specifications.
• We can design the algorithm via written steps or visualized steps
using, for example, flowcharts.
• In the written steps, we can use simple sentences in English or some
special notations and structures in something called "Pseudocode".

0.3 Example 3 30
 Simple
Calculator
The
Suppose that you are asked to write a calculator program that can sum
and subtract two integer numbers. Write the program requirements,
Algorithm
specifications and algorithm.
The algorithm:
1. Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign.
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

0.3 Example 3 31
 Simple Calculator
The Pseudocode and
Flowchart
Suppose that you are asked to write a calculator program that can sum
and subtract two integer numbers. Write the program requirements,
specifications and algorithm.
The algorithm (pseudocode and flowchart):
1. print “Welcome to our Calculator”
2. X = input “Enter the first number:“
3. Y = input “Enter the second number:”
4. Sign = input "Select – or +"
5. if Sign is equal to "+" then:
6. Sum = X + Y
7. else:
8. Sum = X – Y
9. End if
10. print Sum

0.3 Example 3 32
0.3 Example 3 33
 Simple Calculator
Verifying The
1. Display a Algorithm
welcome message that says, “Welcome to our
Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to
Y. Test 1
4. Ask the user to select the sign (-,+) and save it in Sign.
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

“Welcome to our Calculator”

0.3 1 of 7 Example 3 34
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to
Y. Test 1
4. Ask the user to select the sign (-,+) and save it in Sign.
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

Please enter the first number

X = 20

0.3 2 of 7 Example 3 35
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 1
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 20
Please enter the second number

Y = 10

0.3 3 of 7 Example 3 36
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 1
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 20
Y = 10 Please select – or +

Sign = +

0.3 4 of 7 Example 3 37
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 1
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 20
Y = 10
Sign = +
Is Sign equal to “+”? Yes

0.3 5 of 7 Example 3 38
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 1
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 20
Y = 10
Sign = +
Sum = X + Y = 20 + 10 = 30

0.3 6 of 7 Example 3 39
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 1
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 20
Y = 10
Sign = + 30
Sum = 30

Output:
30

0.3 7 of 7 Example 3 40
 Simple Calculator
Verifying The
1. Display a Algorithm
welcome message that says, “Welcome to our
Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to
Y. Test 2
4. Ask the user to select the sign (-,+) and save it in Sign.
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

“Welcome to our Calculator”

0.3 1 of 7 Example 3 41
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to
Y. Test 2
4. Ask the user to select the sign (-,+) and save it in Sign.
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

Please enter the first number

X = 50

0.3 1 of 7 Example 3 42
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 2
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 50
Please enter the second number

Y = 15

0.3 3 of 7 Example 3 43
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 2
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 50
Y = 15 Please select - or +

Sign = -

0.3 4 of 7 Example 3 44
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 2
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 50
Y = 15
Sign = -
Is Sign equal to “+”? No

0.3 5 of 7 Example 3 45
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 2
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 50
Y = 15
Sign = -
Sum = X - Y = 50 - 15 = 35

0.3 6 of 7 Example 3 46
 Simple Calculator
Verifying The
1. Algorithm
Display a welcome message that says, “Welcome to our Calculator".
2. Ask the user to enter the first number and save it to X.
3. Ask the user to enter the second number and save it to Y.
4. Ask the user to select the sign (-,+) and save it in Sign. Test 2
5. if Sign is equal to “+”, make Sum = X + Y
6. Otherwise, make Sum = X - Y
7. Display Sum

The Algorithm The User

x = 50
Y = 15
Sign = - 35
Sum = 35

Output:
35

0.3 7 of 7 Example 3 47
 0.4. Algorithms,
Pseudocode, &
Flowcharts
 Example 4: Determining a Student’s
Final Grade
 Flowcharts
 Flowchart Symbols
 Example 5: Converting The Length
 Example 6: Area of a Rectangle
Calculator
48
 Algorithm, Pseudocode, &
Flowcharts
• What is an algorithm?
◦ A step-by-step series of instructions in order to perform a specific
task.
◦ An algorithm must:
 Be lucid (clear), precise and unambiguous.
 Give the correct solution in all cases, and eventually end.
• What is pseudocode?
◦ It is English that looks similar to code
 But it is not actual code (only looks a little similar) .
 Think of pseudocode as a way of expressing your algorithm.
• What is a flowchart?
◦ A graphical representation of the sequence of operations
in an information system or program.
0.4 49
 Algorithm, Pseudocode, &
Flowcharts
• For Clarity:
◦ An algorithm is a series of steps you take to solve a problem, just
like a recipe is a series of steps you take to make a food!
◦ Now, we express our algorithms in many ways:
 Pseudocode: this is not “real code”, but a slightly more formal way of writing
the algorithmic steps
 As an example, maybe the programmer does not know the language he/she
will use. Therefore, they just write pseudocode during Problem-Solving
Phase.
 Flowchart: this is a graphical representation of the algorithm
 Actual code: this is during the Implementation Phase
 Python, Java, C++, C, etc

0.4 50
 Determining a Student’s
Final Grade
Write an algorithm Example 4 to determine
and pseudocode a
student’s final grade and indicate whether it is passing or
failing. The final grade is calculated as the average of four
marks.

0.4 Example 4 51
 Determining a Student’s
Final Grade
Algorithm
Write an algorithm and pseudocode 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.
Algorithm:
1. Ask the user to enter 4 marks (Mark1, Mark2, Mark3, Mark4)
2. Calculate the marks average (Avg) by summing marks and it dividing by 4
3. If average (Avg) is greater than or equal 60
4. Print “Pass”
5. Else
6. Print “Fail”
7. End if

0.4 Example 4 52
 Determining a Student’s
Final Grade
Write an algorithm andPseudocode
pseudocode 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:
1. input Mark1, Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass”
5. else:
6. print “Fail”
7. End if

0.4 Example 4 53
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 1
5. else:
6. print “Fail”
7. End if

The Algorithm The User

I am waiting you to give me 4 marks

Mark1 = 80, Mark2 = 90, Mark3 = 95, Mark4 = 85

0.4 1 of 5 Example 4 54
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 1
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 80, Mark2 = 90, Mark3 = 95, Mark4 = 85

Avg = (80 + 90 + 95 + 85) / 4 = 350 / 4 = 87.5

0.4 2 of 5 Example 4 55
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 1
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 80, Mark2 = 90, Mark3 = 95, Mark4 = 85
Avg = 87.5

Avg >= 60 = 87.5 >= 60 = Yes

0.4 3 of 5 Example 4 55
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 1
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 80, Mark2 = 90, Mark3 = 95, Mark4 = 85
Avg = 87.5
“Pass”

Output:
Pass

0.4 4 of 5 Example 4 57
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 1
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 80, Mark2 = 90, Mark3 = 95, Mark4 = 85
Avg = 87.5

Output:
Pass

0.4 5 of 5 Example 4 58
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 2
5. else:
6. print “Fail”
7. End if

The Algorithm The User

I am waiting you to give me 4 marks

Mark1 = 42, Mark2 = 55, Mark3 = 60, Mark4 = 37

0.4 1 of 6 Example 4 59
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 2
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 42, Mark2 = 55, Mark3 = 60, Mark4 = 37

Avg = (42 + 55 + 60 + 37) / 4 = 194 / 4 = 48.5

0.4 1 of 6 Example 4 60
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 2
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 42, Mark2 = 55, Mark3 = 60, Mark4 = 37
Avg = 48.5

Avg >= 60 = 48.5 >= 60 = No

0.4 3 of 6 Example 4 61
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 2
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 42, Mark2 = 55, Mark3 = 60, Mark4 = 37
Avg = 48.5

0.4 4 of 6 Example 4 62
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 2
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 42, Mark2 = 55, Mark3 = 60, Mark4 = 37
Avg = 48.5
“Fail”

Output:
Fail

0.4 5 of 6 Example 4 63
 Determining a Student’s
Final Grade Verifying
The
1. input Mark1, Algorithm
Mark2, Mark3, Mark4
2. Avg = (Mark1 + Mark2 + Mark3 + Mark4) / 4
3. if Avg >= 60:
4. print “Pass” Test 2
5. else:
6. print “Fail”
7. End if

The Algorithm The User

Mark1 = 42, Mark2 = 55, Mark3 = 60, Mark4 = 37
Avg = 48.5

Output:
Fail

0.4 6 of 6 Example 4 64
 Flowchart
• A graphical representation of the sequence of operations
in an information system or program.
• Program flowcharts show the sequence of instructions in a
single program or subroutine.
◦ show logic of an algorithm
◦ emphasize individual steps and their interconnections
◦ e.g. control flow from one action to the next
• Different symbols are used to draw each type of flowchart.

0.4 65
 Flowchart
Name
Symbols Use in Flowchart
Symbol
Oval Denotes the beginning or end of the
program.

Parallelogram Denotes an input / output operations.

Denotes a process to be carried out.

Rectangle
For example: addition, subtraction, and
division.

Denotes a decision or branch to be made The program

Diamond
should continue along one of two routes (Ex.
If/Then/Else)

Flow line Denotes the direction of logic flow in the

program

0.4 66
 Flowcharts
• Are flowcharts really necessary or helpful?
◦In the real world, programs are not only 1000 lines.
◦Programs are hundreds of thousands of lines of code.
 Even Millions of lines of code.
◦Could you use only English to describe your program?
 Sure you could, but you would end up with a book!
◦Therefore, think of flowcharts as an easier, clearer way to
quickly understand what a program is doing.

0.4 67
 Flowcharts
• Are flowcharts really necessary or helpful?
◦So in summary, yes, they are helpful.

• That said, most of the programs we show you over

the next few weeks are smaller programs.
◦ Do you really need a flowchart for a small program?
◦ Probably not.
◦ However, students should get into the habit of making flowcharts
with smaller, easier programs.
◦ Then, it will be easy to do for larger programs.

0.4 68
 Converting The
Length Example
Write 5
an Algorithm, Pseudocode, and draw a flowchart to
convert the length in feet to centimeter.

Algorithm:
1. Input the length in feet (LFT)
2. Calculate the length in cm (LCM) by multiplying LFT with 30
3. Print length in cm (LCM)

0.4 Example 5 69
 Converting The
Length The
Pseudocode: Algorithm Start
1. LFT = input “Length in feet”
2. LCM = LFT x 30
input
3. print LCM LFT

Flowchart:
LCM = LFT x 30

output
LCM

End

0.4 Example 5 70
 Converting The
Length Verifying The
Algorithm
The Algorithm
Start

input Test 1
LFT The User

LCM = LFT x 30

output
LCM

End

0.4 1 of 5 Example 5 71
 Converting The
Length Verifying The
Algorithm
The Algorithm
Start

input Test 1
LFT = 15 The User

LCM = LFT x 30

output
LCM

End

0.4 2 of 5 Example 5 72
 Converting The
Length Verifying The
Algorithm
The Algorithm
Start

input Test 1
LFT = 15 The User

LCM = LFT x 30
= 15 x 30 = 450

output
LCM

End

0.4 3 of 5 Example 5 72
 Converting The
Length Verifying The
Algorithm
The Algorithm
Start

input Test 1
LFT = 15 The User

LCM = 450

Output:
output 450
LCM
= 450

End

0.4 4 of 5 Example 5 72
 Converting The
Length Verifying The
Algorithm
The Algorithm
Start

input Test 1
LFT = 15 The User

LCM = 450

Output:
output 450
LCM
= 450

End

0.4 5 of 5 Example 5 72
 Area of a Rectangle
Calculator
Example
Write an Algorithm, Pseudocode, 6 a flowchart that
and draw
will read the two sides of a rectangle and calculate its area.

Algorithm:
1. Input the Length (L) and width (W) of a rectangle
2. Calculate the area (A) by multiplying L with W
3. Print A

0.4 Example 6 76
 Area of a Rectangle
Calculator The
Pseudocode: Algorithm
1. input L, W Start

2. A = L
x W input
L,W
3. print A
Flowchart:
A=LxW

output
A

End

0.4 Example 6 77
 0.5. Decision
Structures
 If–then–else Structure
 Relational Operators
 Example 7: Determining The
Largest Value

78
 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
• Note: Print = Output

0.5 79
 If–then–else
•
Structure
The structure is as follows

if condition then
true alternative
else
false alternative
End if

0.5 80
 If–then–else
•
Structure
The algorithm for the flowchart is as follows:

if A > B then
print A
else
print B
End if

0.5 81
 Relational
Operators
Relational Operators
Operator Description
> Greater than
< Less than
== Equal to
 Or >= Greater than or equal to
 Or <= Less than or equal to
 Or != Not equal to

0.5 82
 Determining The
Largest Value
Example
Write a Pseudocode that 7 determines the
reads two values,
largest value and prints the largest value with an identifying
message.
Start

Pseudocode: input
VALUE1, VALUE2

1. Input VALUE1, VALUE2

2. if (VALUE1 > VALUE2) then Yes is
VALUE1 > VALUE2
No

3. MAX = VALUE1
4. else MAX = VALUE1 MAX = VALUE2

5. MAX = VALUE2
6. endif print
“The largest value is”, MAX

7. print “The largest value is”, MAX

End

0.5 Example 7 83
 Determining The
Largest Value
The Algorithm Start

input
VALUE1, VALUE2

Yes is No
VALUE1 > VALUE2

MAX = VALUE1 MAX = VALUE2

print
“The largest value is”, MAX

End

0.5 Example 7 84
 Determining The
Largest Value
Verifying The
The Algorithm

Algorithm
Start

input
VALUE1, VALUE2
Test 1

Yes is No
VALUE1 > VALUE2
The User

MAX = VALUE1 MAX = VALUE2

print
“The largest value is”, MAX

End

0.5 1 of 6 Example 7 85
 Determining The
Largest Value
Verifying The
The Algorithm

Algorithm
Start

input
VALUE1, VALUE2
Test 1

Yes is No
VALUE1 > VALUE2
The User

MAX = VALUE1 MAX = VALUE2

print
“The largest value is”, MAX

End

0.5 2 of 6 Example 7 86
 Determining The
Largest Value
Verifying The
The Algorithm

Algorithm
Start

input
VALUE1 = 3, VALUE2 = 5
Test 1

Yes is No
VALUE1 > VALUE2
The User

MAX = VALUE1 MAX = VALUE2

print
“The largest value is”, MAX

End

0.5 3 of 6 Example 7 86
 Determining The
Largest Value
Verifying The
The Algorithm

Algorithm
Start

input
VALUE1 = 3, VALUE2 = 5
Test 1

Yes is No
VALUE1 > VALUE2
The User

MAX = VALUE2
MAX = VALUE1
=5

print
“The largest value is”, MAX

End

0.5 4 of 6 Example 7 86
 Determining The
Largest Value
Verifying The
The Algorithm

Algorithm
Start

input
VALUE1 = 3, VALUE2 = 5
Test 1

Yes is No
VALUE1 > VALUE2
The User

MAX = VALUE2
MAX = VALUE1
=5

print
“The largest value is”, MAX
= “The largest value is 5” Output:
The largest value is 5
End

0.5 5 of 6 Example 7 89
 Determining The
Largest Value
Verifying The
The Algorithm

Algorithm
Start

input
VALUE1 = 3, VALUE2 = 5
Test 1

Yes is No
VALUE1 > VALUE2
The User

MAX = VALUE2
MAX = VALUE1
=5

print
“The largest value is”, MAX
= “The largest value is 5” Output:
The largest value is 5
End

0.5 6 of 6 Example 7 90
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 1 of 7 Example 7 91
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 1 of 7 Example 7 92
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 3 of 7 Example 7 93
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 4 of 7 Example 7 94
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 5 of 7 Example 7 94
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 6 of 7 Example 7 94
 Determining The
Largest Value
1.
2.
Verifying
Input VALUE1, VALUE2
if (VALUE1 > VALUE2) then
The
3. MAX =Algorithm
VALUE1
4. else
5. MAX = VALUE2
Test 2
6. endif
7. print “The largest value is”, MAX

0.5 7 of 7 Example 7 94
 Determining The
Largest Value
Example7.py
1
Python Code
value1 = eval(input("Enter Value 1: "))
2 value2 = eval(input("Enter Value 2: "))
3
4 if value1 > value2:
5 largest = value1
6 else:
7 largest = value2
8
9 print("The largest value is", largest)

0.5 Example 7 98
End

99