Goal: The aim of the course is to familiarise students with the basic algorithms for optimisation and problem solving and the most common data structures.
Course description: Common data structures: linked lists, sorted linked lists, stack, queue, priority queue, hash set, dictionary, graph, binary tree. Binary search tree. B-tree. Heap. Hashing. Graphs and graph algorithms.