Strategi Algoritma – Algorithms Strategies
Deskripsi Mata Kuliah – Course Description:
Mata kuliah ini mempelajari tentang berbagai pendekatan dan strategi algoritma dalam menyelesaikan persoalan tertentu, sehingga diharapkan mahasiswa mampu membandingkan kelebihan dan kekurangan berbagai algoritma dan dapat menerapkan strategi algoritma yang tepat untuk persoalan tertentu dari sudut pandang efisiensi waktu dan order of growth.
The course introduces various algorithm design paradigm in solving certain problems. It is expected that the students are able to compare and analyze the strengths and weaknesses of various algorithms and could apply appropriate algorithmic strategies to certain problems from the point of view of time efficiency and order of growth.
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
