Curricula

Objective

The course provides a strong foundation for knowing and analyzing algorithms and data structures. You will learn search and sorting algorithms and abstract data structures, such as lists, tables, queues, and stacks.

EUR-ACE Knowledge and Understanding
You know the key concepts related to algorithms and their implementation. You know the most central abstract data structures.

EUR-ACE Engineering practice
You know how to choose the data structures suitable for the implementation of the algorithm. You know how to evaluate the implementation and efficiency of an algorithm.

Content

algorithm types
efficiency classification and analysis of algorithms
search and sorting algorithms
abstract data structures
lists and arrays
queue and stack
linked list
trees

Qualifications

Basics of Programming

Assessment criteria, satisfactory (1)

Sufficient (1)
You know the algorithm concept. You recognize abstract data structures. You know how to implement an algorithm with some data structure.

Satisfactory (2)
You know concepts related to algorithms and their implementation. You know the most common linear data structures. You know how to implement an algorithm with some data structure. You can evaluate the implementation of a simple algorithm.

Assessment criteria, good (3)

Good (3)
You know the key concepts related to algorithms and their implementation. You are familiar with the most central abstract data structures. You can implement the algorithm with the selected data structure. You know how to evaluate algorithm implementation and measure efficiency.

Very good (4)
You know the concepts related to algorithms and their implementation. You are familiar with the operating principles of abstract data structures. You recognize the data structures that are well suited to the implementation of the algorithm. You can analyze the implementation and efficiency of the algorithm.

Assessment criteria, excellent (5)

Excellent (5)
You know the concepts related to algorithms and their implementation. You can recommend abstract data structures suitable for the problem. You know how to choose the data structures best suited to the implementation of the algorithm. You know how to analyze the implementation of the algorithm and, if necessary, improve its efficiency.