Game programming datastructures (5 cr)

Objective

The goal of this course is to gain reasonable knowledge and skills related to basic data structures and algorithms in game programming. After completing the course the students understand the memory usage in data structures and performance features of algorithms, which gives them enough tools to make a conscious choice between different data structures and algorithms. In addition, the students learn how to implement the most common data structures and algorithms in games using a particular programming language (C++).

Content

This is an introduction course to algorithms and data structures applied to game programming problems, which means we will learn about recursion, algorithm analysis & performance measures, abstract data types (such as List, Stack, Queue, Deque). The course also includes several data structures, e.g. trees (binary tree, binary search tree, m-tree, red-black tree) and heap. The course also covers algorithms related to hashing and sorting, as well as graphs and graph algorithms, such as Dijkstra's algorithms and A*.

Evaluation

Students are able to grasp the most important concepts of the field (a), look for information in the key information sources of the field (b), identify interrelated tasks in the field (c), use and apply the key structures and methods of the field (d), and create software program solutions to problems at hand (e).

Course material

Electronic material as well as web material published on the course's Learn platform. Exercises and their model answers are also given to students on the course's Learn platform and / or Teams channel.

Study forms and methods

Participation in contact and / or remote learning according to the work schedule. The student completes the assignments, tasks and project work required in the course before the given deadlines and participates in the exam at the end of the course if it will be arranged.

Alternative methods of study must be agreed with the lecturer in charge before the beginning of the course.

RDI and work-related cooperation

During the course students will implement data structure and algorithm programming tasks, which can be later utilized in different game projects and simulations.

Timing of exams and assignments

Exercises and assignments will be returned to the Learn platform by the deadline specified there.

Student workload

A total of 135h, of which about 70h is contact learning and 65h is independent work.

Evaluation scale

1-5

Assessment methods and criteria

Participation in contact learning, completing course assignments and project work.

Qualifications

Programming 1
Game Programming
Programming 2