How to design algorithms How to express algorithms Proving correctness Efficiency (or complexity) analysis Theoretical analysis Empirical analysisīrute force Divide and conquer Decrease and conquer Transform and conquer Greedy approach Dynamic programming Backtracking and branch-and-bound Space and time tradeoffs Some well-known of computational domain 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 dont have efficient algorithms, or algorithms at all! Statement of problem: Input: A sequence of n numbers Output: A reordering of the input sequence so that ai0 ≤ aj0 whenever i Algorithms: Selection sort Insertion sort Merge sort (many others) Can be represented various forms Unambiguity/clearness Effectiveness Finiteness/termination Correctness What is 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.Īn 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. TUGAS 15% KUIS 20% UTS 25% TUGAS BESAR 15% UAS 25% NB: Bonus jika absensi mencapai 100% (Membuat buku tugas yang akan dikumpul setiap pengumpulan tugas) Mahasiswa mampu merancang suatu algoritma berdasarkan contoh-contoh algoritma yang sudah diberikan.įigure : Main reference. Mahasiswa mampu membedakan tipe dan karakteristik masing-masing algoritma.
Mahasiswa mampu menganalisis kompleksitas suatu algoritma. Mahasiswa mampu untuk mejelaskan kompleksitas waktu pada suatu algoritma
Introduction About this course Beginning of Algorithm The efficiency of algorithmĮxercise Rules Skilled Group Careful Group Smart Group Of Computational Science School of Computing Telkom Universityĭr.
Design and Analysis of Algorithm Week 1: Introduction Dr.
0 kommentar(er)
