Pendahuluan

Pertemuan : I

Jurusan Teknik Informatika – Universitas Widyatama

Overview

• Deskripsi
• Tujuan Instruksional
• Kaitan Materi
• Urutan Bahasan
• Penilaian
• Grade
• Referensi

IF-UTAMA 2
Pendahuluan

• Deskripsi
Matakuliah Desain dan Analisis Algoritma ini
membahas Efisiensi algoritma, analisis kompleksitas
dan strategi algoritma untuk menyelesaikan berbagai
permasalahan.

IF-UTAMA 3
Pendahuluan

• Tujuan Instruksional
– tingkat pemahaman : tentang konsep-konsep dan teknik
penyelesaian masalah menggunakan berbagai strategi
algoritma.
– tingkat aplikasi : tentang membuat penyelesaian masalah
menggunakan berbagai strategi algoritma.

• Kaitan Materi
Terkait dengan Mata Kuliah Algoritma & Pemrograman II,
Struktur Data dan Algoritma Lanjut serta Matematika Diskrit.

IF-UTAMA 4
Pendahuluan

• Urutan Bahasan
Pertemuan Materi
1 Dasar-dasar algorithmic problem solving
Important Problem types
Fundamental data structure
2 Input Size, Basic Operation, Perhitungan running time, Efisiensi
best-case, worst case dan average case
3-4 Informal introduction, Notasi Big-O, Big- Ω dan Big-θ, Basic
Efficiency Classes
5-7 Tahapan untuk analisis efisiensi untuk algoritma non rekursif
Basic Rule of sum manipulation
Summation Formula, Characteristic Equation
8 UTS
IF-UTAMA 5
Pendahuluan

• Urutan Bahasan
Pertemuan Materi
9 Brute Force Algorithm, Sorting, Searching
10 Knapsack Problem, TSP, Assignment problem
11 Greedy Algorithm, MST, Knapsack Problem, Huffman, Djikstra
12 DnC: Sorting, Searching
13 Backtracking: N-Queens, Sum of subset problem, Knapsack
Problem
14 Branch and Bound: N-Queens, Knapsack Problem, Travelling
Salesman Problem
15 Dynamic Programming: Knapsack Problem, Memory Function
16 UAS
IF-UTAMA 6
Pendahuluan

• Penilaian

Tugas/Kuis 30%

Kehadiran 10%

UTS 30%

UAS 30%

UTS & UAS akan dipecah menjadi Tugas Besar 10%

Ujian Mandiri 20%
IF-UTAMA 7
Referensi

1. Introduction to Algorithms, 2nd edition, T. H. Cormen,

C. E. Leiserson, R. L. Rivest, and Clifford Stein,
Published by: MIT Press or McGraw-Hill
2. Introduction to the design and analysis of algorithm,
Anany Levitin, Published by: Addison Wesley 2003
3. Foundations of algorithms, Richard Neapolitan,
Kumarss Naimipour, Published by D.C Heath and
Company 1996
4. Diktat Strategi Algoritmik IF2251, Dr. Ir. Rinaldi Munir,
M.T, Departemen Teknik Informatika, Institut
Teknologi Bandung

IF-UTAMA 8
 Intro

Jurusan Teknik Informatika – Universitas Widyatama

What is an algorithm?
An algorithm is a sequence of unambiguous
instructions for solving a problem, i.e., for obtaining
a required output for any legitimate input in a finite
amount of time.
problem

algorithm

input “computer” output

1-10
 Some Well-known Computational
Problems

• Sorting
• Searching
• Shortest paths in a graph
• Minimum spanning tree
• Primality testing
• Traveling salesman problem
• Knapsack problem
• Chess
• Towers of Hanoi
• Program termination

Some of these problems don’t have efficient algorithms,

or algorithms at all!
1-11
Algorithm design strategies

• Brute force  Greedy approach

• Divide and conquer  Dynamic programming

• Decrease and conquer

 Backtracking and branch-and-bound
• Transform and conquer
 Space and time tradeoffs

1-12
Analysis of Algorithms

• How good is the algorithm?

– Correctness
– Time efficiency
– Space efficiency

• Does there exist a better algorithm?

– Lower bounds
– Optimality

1-13
What is an algorithm?
Recipe, process, method, technique, procedure, routine,… with the
following requirements:
1.Finiteness
 terminates after a finite number of steps
2.Definiteness
 rigorously and unambiguously specified
3.Clearly specified input
 valid inputs are clearly specified
4.Clearly specified/expected output
 can be proved to produce the correct output given a valid
input
5.Effectiveness
 steps are sufficiently simple and basic

1-14
Analysis of algorithms

• How good is the algorithm?

– time efficiency
– space efficiency
– correctness ignored in this course

• Does there exist a better algorithm?

– lower bounds
– optimality

1-15
Important problem types
• sorting

• searching

• string processing

• graph problems

• combinatorial problems

• geometric problems

• numerical problems
1-16
Fundamental data structures

• list  graph
– array  tree and binary tree
– linked list  set and dictionary
– string
• stack
• queue
• priority queue/heap

1-17
Grup Line

REG A
•https://line.me/R/ti/g/bz_OS6Gzvx (kls C)
•https://line.me/R/ti/g/2_qk1gMh22 (kls B)

Reg B1
https://line.me/R/ti/g/I3VUohL-Cu

Reg B2
https://line.me/R/ti/g/5pfqJISSXM
IF-UTAMA 18