Scribd
Upload
99 views22 pages

CSE012.Chapter 3 Flow Charts

The document describes the steps to solve problems using computers: 1) understand the problem, 2) define variables and facts, 3) make assumptions, 4) select formulas, 5) solve the problem, and 6) check results. It then explains that to solve a problem using a computer, one must develop an algorithm using steps 1-4, represent the algorithm with a flowchart, and code it into a programming language. Flowcharts provide a graphical way to design programs by arranging ideas visually in a language-independent manner to more easily check algorithms and test programs.

Uploaded by

Maro Achraf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
99 views22 pages

CSE012.Chapter 3 Flow Charts

The document describes the steps to solve problems using computers: 1) understand the problem, 2) define variables and facts, 3) make assumptions, 4) select formulas, 5) solve the problem, and 6) check results. It then explains that to solve a problem using a computer, one must develop an algorithm using steps 1-4, represent the algorithm with a flowchart, and code it into a programming language. Flowcharts provide a graphical way to design programs by arranging ideas visually in a language-independent manner to more easily check algorithms and test programs.

Uploaded by

Maro Achraf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

How do you solve a problem in the exam?

1. Understand the problem.
2. Define the variables and collect the 
required facts (inputs).
3. Make any assumptions if needed.
4. Select suitable formulae or theorems.
5. Solve the problem.
6. Check your results.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
• The computer is only a problem‐solving tool
• To use the computer to solve a problem:
• Perform steps 1‐4 in previous slide
• Develop the steps the computer should 
follow to solve the problem or Algorithm
• Represent the steps graphically using a 
Flowchart.
• Edit, run and test the program in a 
computer programming language, Fortran, 
C, Java, Python ….
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
• Definition
• A graphical approach to Design/Plan 
the program
• Why?
• Arrange our ideas in a visual way
• Is programming language independent
• Easier for checking the correctness of 
the algorithm and testing the program

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Problem: Calculate the area of a rectangle given 
its length and width.
Analysis:
Inputs: Length L and Width W, Output: Area
Formula: Area = L*W
Assumptions: L, W > 0
Steps:
1. Input L, W
2. Calculate Area
3. Output Area
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Sequential 
Instructions

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Problem: Given the score of a student in an exam, 
print “Failed” if the score is less than 50 or 
“Succeeded” otherwise.
Analysis:
Input: Score, Output: “Succeeded”/“Failed”
Assumptions: 0 ≤ score ≤ 100
Steps:
1. Input Score
2. If Score < 50 Print “Failed”
Else Print “Succeeded”
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
2‐sided if structure

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Problem: Read 3 numbers and print the value of 
the greatest one.
Analysis:
Inputs: A, B, C, Output: max(A, B, C)
Steps:
1. Input A, B, C
2. If A > B 
If A > C Print A, Else Print C
Else
If B > C Print B, Else Print C
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Nested if 
structure

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Problem: Print numbers from 1 to 100.

Analysis:
Input: None, Output: Numbers from 1 to 100

Steps:
1. I = 1
2. Repeat until I > 100
i. Print I
ii. I = I + 1
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Start

Repetition or
loop structure I=1

with loop test
at the bottom PRINT I

I=I+1

Yes is
I <= 100
?

No

END

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Input: None Start
Output: Odd Numbers from
1 to 100
I=1

PRINT I

I=I+2

Yes is
I < 100
?

No

END

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Input: M Start

Output: Numbers from 1 to M 
and their squares INPUT M

1 1 I=1

2 4
J=I^2
3 9
.. .. PRINT I, J

M M2
I=I+1

No is
I>M
?
Yes

END

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Input: None
Start
Output: Sum

SUM = 0
N=1

SUM = SUM + N

N=N+1 PRINT SUM

Yes is No
N <= 100
? END

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Problem: Calculate the average of the scores of 50 
students.
Analysis:
Input: scores of 50 students, Output: average score
Formula: Average = (S1+ ... + S50)/50
Steps:
1. Initialize Sum=0, N=1
2. Repeat until N > 50
i. Input next Score
ii. Sum = Sum + Score
iii. Increment N
3. Print Sum/50
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Start

SUM = 0
N=1

INPUT SCORE

SUM = SUM + SCORE AVERAGE = SUM / 50

N=N+1 PRINT AVERAGE

No is Yes END
N > 50
?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
1
N 1 N
M

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Problem: Calculate the factorial of an integer.
Analysis:
Input: M, Output: F
Formula: F = M*(M‐1)* … * 1 for M ≥ 1
F = 1 if M = 0 (special case)
Assumption: M is non‐negative 
Steps:
1. Input M
2. Initialize F=1, N=1
3. While M>N
i. N=N+1
ii. F=F*N
4. Print F

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
In this example the
loop test is the first
statement in the
loop. Why?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Next week In-Shaa-Allah
Chapter 4
Introduction to
Computer Programming

Thank You
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

You might also like