Sidia is a education Platform website.
Course Description
This lecture teaches how to design and analyze an algorithm to solve problems that require programming. The two main issues emphasized in designing and analyzing these algorithms are the aspects of correctness and complexity. Various techniques and approaches will be discussed, including dynamic programming, greedy algorithms, backtracking, graph algorithms, approximation algorithms, and others.
Program Objectives (PO)
- 1. Mampu menerapkan teknik-teknik komputasi yang tepat dalam menyediakan solusi berbasis komputer sesuai kebutuhan dan mengevaluasi solusi yang diberikan
- 1. Mampu mengevaluasi rancangan algoritma yang dipilih, baik melalui evaluasi analitis maupun pengujian
- Mampu menyelesaikan masalah menggunakan ilmu komputer
Aktifitas Pembelajaran
-
Pertemuan 1 Konsep dan teknik penting dalam mendesain dan menganalisis efisiensi algoritma -
Pertemuan 2 Konsep algoritma brute force -
Pertemuan 3 Mengenal algoritma Greedy -
Pertemuan 4 Strategi Devide-and-Conquer -
Pertemuan 5 Strategi Decrease-and-Conquer -
Pertemuan 6 Konsep NP hard problem -
Pertemuan 7 Mengenal contoh NP hard problem (TSP) -
Pertemuan 8 -
Pertemuan 9 Konsep algoritma backtracking -
Pertemuan 10 Konsep pemrograman dinamis -
Pertemuan 11 Konsep dan implementasi graf dan algoritma fundamental pada bidang computer science -
Pertemuan 12 Merancang project -
Pertemuan 13 Kemajuan project -
Pertemuan 14 Presentasi project -
Pertemuan 15 Revisi project -
Pertemuan 16 Membuat program komputer untuk menyelesaikan permasalahan yang berkaitan dengan sains data
References
- Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C., Introduction to Algorithms (3rd edition), MIT Press, 2009.
- Levitin, A. Introduction to The Design & Analysis of Algorithms . 2003. Pearson Education, Inc.
- Stuart J Russell & Peter Norvig, Resources of topics in Artificial Intelligence: A Modern Approach, 3rd Edition, Global Edition Paperback, Pearson, 2016, http://aima.cs.berkeley.edu/
- Rinaldi Munir, Diktat kuliah IF2251 Strategi Algoritmik, Teknik Informatika ITB
- Introduction to The Design & Analysis of Algorithms, Anany Levitin, Pearson Education, Inc.
- Bhardwaj, Anuj; Verma, Parag, Design and Analysis of Algorithm, Alpha Science International Ltd., 2017, can be accessed at: http://portal.igpublish.com/iglibrary/obj/APSB0000252?dtbs=&sear chid=1573133164973plapRvm7MQJMAwkcwThUs from https://lib.itb.ac.id/
- Khan Academy, Computer Science: Algorithm, can be accessed at https://www.khanacademy.org/computing/computer-science/algorithms
Lecturer
Difficult Things About Education.
$75$10
More Similar Courses
Related Courses
Conservation of Natural Resources and the Environment
Discusses: 1) The scope of conservation which includes: Definition, objectives, benefits and efforts to conserve natural resources and the environment (SDAL); 2) Environmental ethics which
Differential Calculus
Studying the real number system, real functions, limits and continuity, derivatives of real functions and their uses, transcendent functions and their derivatives, limits of irregular
The Basics of Mathematics
Examining mathematical characteristics, deductive-axiomatic systems and structures, logical operations, quantifiers, drawing conclusions, sets, relations and functions through active learning through ICT-assisted active learning using lecture,
Copyright © 2024 Sinau Digital UNESA All Rights Reserved