2ADS101 Algorithms and Data Structures for Games

By completing the course, the student will have achieved the following learning outcomes: 

Knowledge 

The student 

• has knowledge of the most important data structures and algorithms for use in games and simulation 
• has knowledge of national and international research and development work of relevance to the course, and knows how to update their knowledge within the field 

Skills 

The student 

• has skills in data structures and algorithms for use in games and simulation  
• is able to identify problems in games and systems thinking that can be solved by using known data structures/algorithms 
• is able to use data structures/algorithms in problem solving 
• is fully conversant with and is able to use relevant professional tools, methods and theory 

General competence 

The student 

• is able to disseminate key academic material orally and in writing, take part in professional discussions within the subject area and share their knowledge and experiences with others 

Central topics: 

• stack, queue and priority queue  
• binary tree, quad tree, octree  
• spanning tree, trees and graphs in general
• search and sorting
• Dijkstra's algorithm and A* algorithm 
• chained lists 
• recursion
• abstract data types 

Lectures and problem-solving exercises. 

• 3–5 individual assignments 
• attendance at lectures in accordance with the teaching plan  
• attendance at laboratory teaching in accordance with the teaching plan 

• 4-hour individual written examination 

Alphabetical grades are used on degree from A to F, with E as the lowest passing grade.