Study Guide

Objective

The student knows and can apply the primary data structures and algorithms. The student can compare their efficiency and complexity.

Content

- Algorithmic complexity and evaluation of the performance of algorithms: the Big O notation.
- The primary data structures and their implementations: arrays, linked lists, stacks, queues, graphs, binary trees.
- The primary algorithms and their implementations: recursion, searching and sorting.

Assessment criteria, satisfactory (1)

The student can compare the complexity of algorithms and apply some basic data structures and algorithms.

Assessment criteria, good (3)

The student can compare the complexity of algorithms and apply a variety of data structures and algorithms. The student is familiar with the internal implementation of the most common data structures and algorithms.

Assessment criteria, excellent (5)

The student can evaluate the complexity of algorithms and apply a wide variety of data structures and algorithms. The students is familiar with the internal implementation of the primary data structures and algorithms. The student can choose the most effective data structures and algorithms for a given task.