The document discusses problem analysis in algorithm goals, focusing on selecting optimal travel methods (aeroplane, bus, train) based on time efficiency. It presents a maximum-minimum algorithm for determining the fastest option and outlines conditions for problem-solving through forward and backward thinking. Additionally, it offers a grading system based on input marks ranging from 0 to 100, categorizing results into grades 'a' to 'e'.

1. Problem Analysis
in Algorithm

2. Goals
• determine conditions  results
• perform problem analysis properly

3. Task 1 (pair)
Semarang Jakarta
free ticket immediately
Select one! Why?

4. Analysis
• Problem : Arrive Jakarta immediately
• Time (hour):
aeroplane 1
bus 6
train 5
• Solution ?
maximum minimum

5. Algorithm
• Compare time spent
aeroplane vs bus ?
result vs train?

6. Forward Thinking
Conditions :
(a < b) 
(a >= b) 
(a < t)  a
(a >= t)  t
(b < t)  b
(b >= t)  t

7. Backward Thinking
(a < b) and (a < t)
(a >= b) and (b < t)
(a >= t) and (b >= t)
 a
 b
 t
Result :

8. Problem Solving Direction
Forward
Backward
problem solution

9. Task 2 (group)
Categorize an input mark (range 0..100)
to decide grade (‘A’, ‘B’, ‘C’, ‘D’,or ‘E’)
Example :
mark grade
89 ‘A’
75 ‘B’
42 ‘E’

10. Leak Analysis
depend on NA:
0 ≤ NA < 50 : ‘E’
50 < NA < 60 : ‘D’
60 < NA < 70 : ‘C’
70 < NA < 80 : ‘B’
80 < NA ≤ 100 : ‘A’

11. Consideration
Ensure all conditions are handled

12. Reference
• Liem, Inggriani. 2003.
Algorithm and Programming. Bandung: ITB
Thank You