Analisis Kompleksitas Algoritma – Analysis of Algorithm Complexity
Deskripsi Mata Kuliah – Course Description:
Mata kuliah ini mempelajari tentang analisis kebenaran algoritma dan kompleksitas waktunya dalam menyelesaikan persoalan tertentu dengan menerapkan konsep induksi matematika dan ekspresi matematika lainnya. Diharapkan mahasiswa mampu merumuskan kelebihan dan kekurangan berbagai algoritma, dan menerapkan algoritma yang tepat dari sisi efisien untuk persoalan tersebut.
This course introduces analysis of the correctness of algorithms and the complexity of their time in solving certain problems by applying the concepts of mathematical induction and other mathematical expressions. It is expected that students will be able to formulate the strengths and weaknesses of various algorithms, and apply the appropriate algorithm in terms of its efficiency.
Pustaka – Bibliography:
Utama:
1. [CLR09] T. H. Cormen, C. E. Leiserson, R. L. Riverst, C. Stein. Introduction
to Algorithms – 3rd Edition, MIT Press, 2009.
2. [LEV14] A. Levitin. Introduction to The Design and Analysis of Algorithms –
3rd Edition, Pearson, 2011.
3. [NN14] R. Neapolitan, K. Naimipour. Foundations of Algorithms – 5th Edition,
Jones and Bartlett Learning, 2014.
Pendukung:
1. [RM06] Ir. Rinaldi Munir, M.T. Diktat Strategi Algoritmik IF2251.
Departemen Teknik Informatika, Institut Teknologi Bandung
2. [IPR01] Ian Parberry. Lecture notes on Algorithm Analysis. Departmen of
Computer Sciences, University of North Texas, 2001.
