Study Guide

Objective

After completing this course you are familiar with the most common data structures and algorithms needed in programming, understand the meaning of abstract data types, implementation aspects of different data structures and usage of encapsulation and interfaces. In addition, you are able to choose suitable data structures to given problems and apply algorithms in problem solving.

Content

The course deals with algorithm analysis, running time complexity and notation, abstract data types, implementation of data structures, recursion, linear data structures, list, stack, queue and deque, tree structures, priority queue and heap, hashing, sorting, graphs, encryption and algorithmic classes.

Materials

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.

Teaching 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.

Employer connections

During the course, students will use the most popular game engines to implement small game programming tasks and simple algorithms, which can be later utilized in different game projects and simulations.

Exam schedules

Exercises and assignments will be returned to the Learn platform by the deadline specified there. Possible exam schedule will be agreed upon together with the students.

International connections

Possible international connections will be announced in the beginning of the course on the Learn-page and on the Teams-channel of the course when needed.

Student workload

A total of 135h, of which about 55hrs is contact learning and 80hrs is independent work.

Evaluation scale

1-5

Assessment methods and criteria

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

Objective

After completing this course you are familiar with the most common data structures and algorithms needed in programming, understand the meaning of abstract data types, implementation aspects of different data structures and usage of encapsulation and interfaces. In addition, you are able to choose suitable data structures to given problems and apply algorithms in problem solving.

Content

The course deals with algorithm analysis, running time complexity and notation, abstract data types, implementation of data structures, recursion, linear data structures, list, stack, queue and deque, tree structures, priority queue and heap, hashing, sorting, graphs, encryption and algorithmic classes.

Materials

Will be presented in learning environment.

Teaching methods

Online studies during course implementation. Previous higher education studies may replace the course and can be discussed at the beginning of the course implementation.

Employer connections

-

Student workload

135 h

Evaluation scale

1-5

Assessment methods and criteria

Exercises returned in learning environment.