BIM 222 - Algorithm Analysis

The aim of this course is to provide students with fundamental knowledge and skills in designing algorithms, evaluating their accuracy, and analyzing their efficiency. The course covers key topics such as time and memory complexity, asymptotic notation, search and sort algorithms, recursive algorithms, greedy algorithms, divide and conquer, dynamic programming, and graph algorithms, enabling students to select, compare, and evaluate algorithms suitable for different problems.

The concept of algorithms and algorithm analysis, asymptotic representations (Big-O, Θ, Ω), time and space complexity analysis, examination of sorting algorithms and their complexities, search algorithms and best-mean-worst-case analyses, time complexity of binary tree-based algorithms, graph representations and graph-based algorithms (BFS, DFS, shortest path and minimum spanning tree algorithms), greedy algorithm approach and its applications.