Study Guide

Objective

The goal of this course is for the student to gain basic knowledge and skills for utilizing different data structures and algorithms in game programming. After completing the course students will have an understanding of memory use and processing time consumption of algorithms and they will be able to choose between different algorithmic solutions and data constructs. In addition, students who pass the course can implement the most common data structures and algorithms for solving problems in games.

Content

This course is an introduction into data structures and algorithms and their application in game programming problems. In practice, the students become familiar with recursion, algorithm analysis, performance analysis and abstract data types, such as List, Stack, Queue and Deque. Additionally, practical data structures, such as trees (binary tree, binary search tree, m-tree, red-black tree) and heaps are examined in detail. The course also covers multiple different algorithms for sorting and hashing along with graphs and related algorithms, e.g. Dijkstra and A-star.