Sabancı Üniversitesi
Mühendislik ve Doğa Bilimleri Fakültesi
Bilgisayar Bilimi ve Mühendisliği
The students are expected to be able to analyse algorithms' resource usage by using asymptotic analysis and asymptotic notations.
The students are expected to be able identify the algorithm design technique used by a given algorithm such as divide-and-conquer, dynamic programming, greedy, etc.).
The students are expected to be able to use these algorithm design techniques to develop new algorithms for simple computational problems.
The students are expected to be aware of some common computational problems and some known algorithms for these problems.
The students are expected to know that there are limits of algorithmic approaches to the computational problems.
The students are expected to be able to design tests to analyse the correctness and the performance of practical implementations of algorithms.
CS 301 dersinden özel ders almak için bizimle iletişime geçebilirsiniz.
Henüz değerlendiren olmadı.İlk değendiren siz olun.
Tüm hakları saklıdır © 2024