2ADS101 Algorithms and data structures for games
- Number of credits10
- Teaching semester2025 Autumn
- Language of instructionEnglish
- CampusHamar
- Required prerequisite knowledge
Recommended: 2MAT201-Mathematics II
-
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
Learning Outcome
Once the student has passed the course, they will have achieved the following learning outcomes:
The student
-
has knowledge of the most important data structures and algorithms for use in games and simulation
-
has knowledge of the efficiency of different algorithms
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
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
-
3–5 individual assignments
-
participation in teaching in accordance with the teaching plan
| Form of assessment | Grading scale | Grouping | Duration of assessment | Support materials | Proportion | Comment |
|---|---|---|---|---|---|---|
Portfolio Assessment | ECTS - A-F | Individual |