Scribd
Upload
76 views19 pages

Algoritma & Struktur Data

Here is the flowchart for the algorithm: START Input N1, N2, N3 N1 > N2? Yes No N1 > N3? N2 > N3? Yes Yes MAX ← N1 MAX ← N2 No No MAX ← N3 MAX ← N3 Print "The largest number is", MAX STOP

Uploaded by

FSArif
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
76 views19 pages

Algoritma & Struktur Data

Here is the flowchart for the algorithm: START Input N1, N2, N3 N1 > N2? Yes No N1 > N3? N2 > N3? Yes Yes MAX ← N1 MAX ← N2 No No MAX ← N3 MAX ← N3 Print "The largest number is", MAX STOP

Uploaded by

FSArif
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/ 19

Algoritma dan Struktur Data

http://www.unhas.ac.id/amil/mk/S1TE/2014_2/AS/

Kuliah #2
By
Dr. Amil Ahmad Ilham, S.T., M.IT.
http://www.unhas.ac.id/amil
ALGORITHMS AND PROGRAMMING

• A typical programming task can be divided into two


phases:
• Problem solving phase
– produce an ordered sequence of steps that describe
solution of problem
• Implementation phase
– implement the program in some programming language
Steps in Problem Solving
• Write pseudocode
– a general algorithm , an artificial and informal language
that helps programmers develop algorithms.
• Write algorithm
– The sequence of steps that describe solution of problem
• Draw a flowchart
– graphical tools, containing a set of shapes, each
expressing a different action in a sequence of program
execution.
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. “Fail” if the average is
below 50.
Pseudocode
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”
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
Flowchart
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 IS Y
GRADE<50

PRINT 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 Input


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

Algorithm START

• Step 1: Input W,L Input


W, L
• Step 2: A ← L x W
• Step 3: Print A A←LxW

Print
A

STOP
Example 4
• Write an algorithm and draw a flowchart that will
calculate the roots of a quadratic equation
ax 2 + bx + c = 0
• Hint: d = sqrt ( b 2 − 4ac ), 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
START

• Algorithm:
Input
• Step 1: Input a, b, c a, b, c
• Step 2: d ← sqrt (b × b − 4 × a × c )
• Step 3: x1 ← (–b + d) / (2 x a) d ← sqrt(b x b – 4 x a x c)

• Step 4: x2 ← (–b – d) / (2 x a)
x1 ←(–b + d) / (2 x a)
• Step 5: Print x1, x2
X2 ← (–b – d) / (2 x a)

Print
x1 ,x2

STOP
DECISION STRUCTURES
Select between alternate courses of action
depending upon the evaluation of a condition

If ( condition = true ) then


statement block 1 True False

else condition
statement block 2
end if statement statement
block 1 block 2

15
Example 5
• Write an algorithm that reads two values, determines the
largest value and prints the largest value.

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

Print
“The largest value is”, MAX

STOP
Example 6
Step 1: Input N1, N2, N3
• Write an Step 2: if (N1>N2) then
algorithm that if (N1>N3) then
MAX ← N1
reads three else
numbers and MAX ← N3
prints the value endif
else
of the largest if (N2>N3) then
number. MAX ← N2
else
MAX ← N3
endif
endif
Step 3: Print “The largest number is”, MAX
Example 6
• Draw the flowchart of the above Algorithm.

You might also like