Algorithms 2

  • ECTS

    5 credits

  • Training structure

    Faculty of Science

Description

Continuation of HAI101I, Algorithms 1

Read more

Objectives

Contents:

  • tree data structures: binary trees, heaps, ABRs, priority queues

  • sort by pile, lower bound on sort

  • Simple graph structures: representations (adjacency matrices, edge lists, neighbor lists),
    Basic algorithms (connectivity, depth-first and breadth-first traversal, topological sorting), distance calculation (Dijkstra, implementation with heaps)

Read more

Teaching hours

  • Algorithms 2 - Practical WorkPractical Work3 p.m.
  • Algorithms 2 - TutorialTutorial6 p.m.
  • Algorithms 2 - LectureLecture12 hours