ECTS
5 credits
Component
Faculty of Science
Description
HAI101I Suite, Algorithms 1
Objectives
Contents:
-
tree-like data structures: binary trees, heaps, ABR, priority queues
-
heap sorting, lower limit on sorting
-
simple graph structure: representations (adjacency matrices, edge lists, neighbor lists),
basic algorithms (connectedness, depth and width traversal, topological sorting), distance calculation (Dijkstra, heap implementation)