Chapter1 Introductionofalgorithms
Chapter1 Introductionofalgorithms
Introduction of Algorithms
Mangaras Yanu F.
2020
Steps of the
Day
Rules Of Introduction
Lecture Syllabus of Algorithms
Let’s Start
Rules of
Lecture
• Prerequisite : none
Don’t be CHEATING!!!
• Presence : 10%
Components of Value
• Homework : 20%
• Middle Test : 30 %
• Final Test : 40%
• Rinaldi Munir, Algoritma &
Pemrograman
• Inggriani Liem, Diktat Algoritma dan
References
Pemrograman
Syllabu
s
• Sequential Structure
• Branching Structure
• Middle Test
• Looping and Structure
• Procedure and Function
Syllabus of Subject
• High Level
• Middle Level
• Low Level
Build the Program
• Problem Definition
• Requirements Analysis
• Build the algorithms
• Coding
• Testing and Debugging
• Maintenance
• Documentation
What is Algorithm?
DESCRIPTIVE ANALYSIS
FLOW CHART
PSEUDO CODE
Example of Descriptive Analysis
SYMBOL ACTIVITY
INPUT/OUTPUT
PROCESSING
DECISION
PROCEDURE/SUBROUTINE
Example of Flow Chart
SYMBOL ACTIVITY
FLOW LINES
START/TERMINATOR
ON PAGE CONNECTOR
1 Algoritma Tambah_Nilai
2 {I.S.: Nilai kesatu dan kedua diinisialisasi}
3 {F.S.: Menghitung penambahan nilai kesatu dan kedua}
4
5 Deklarasi: {atau Kamus:}
6 a,b,c:integer
7
8 Algoritma:
9 a1
10 b2
11 ca+b
Ilustration of Exchange Value with
Variable
A B A B
Ilustration of Exchange Value with
Variable
B
A
B A
A C
A
C
Ilustration of Exchange Value with
Variable
A B
C
EXERCISE
Exercise 1