သင်တန်းနှင့်ပတ်သတ်သော အချက်အလက်

Course topics: Algorithmic problem solving. Time and memory complexity of specific algorithms. Recursion. Weaknesses of recursion. Complexity of recursive algorithms. Sorting algorithms and their complexity. Selected algorithms on graphs and their complexity. Selected number theory algorithms. Methods of creating efficient algorithms. Polynomial and exponential time complexity. NP-complete problems and their importance.

Supervisors and educators:
prof. Ing. Veronika Stoffová, CSc. - Zabezpečuje, Hlavný garant
doc. PaedDr. Milan Pokorný, PhD. - Zabezpečuje, Skúšajúci, Kogarant, Prednášajúci, Zodpovedný za elearning, Cvičiaci

Code: YMIM401

Period: ZS

Credits: 3