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