Goal: Developing the student’s conceptualization, abstraction, and problem-solving abilities by learning about the basic topics of algorithm theory as well as their applications in problem solving and model creation. The basic concepts of graph algorithms and complexity theory are learned.
Course description: Dynamical programming, graph algorithms: BFS, DFS, maximal matching in bipartite graphs, Bellman-Ford’s, Floyd’s, Dijkstra’s algorithm, sorting: insertion sort, bubble
sort, shell sort, merge sort, quick sort, bucket and radix sort, binary search tree, 2-3 tree, B tree, Jarnik-Prim’s algorithm, Kruskal’s algorithm, P, NP, coNP classes and their connections, NP-completeness.
https://nik.uni-obuda.hu/targyleirasok/wp-content/uploads/2026/02/HG_algth_2526_2.pdf