Charles Explorer logo
🇬🇧

Algorithms and data structures

Class at Faculty of Education |
OKBI3I016A

This text is not available in the current language. Showing version "cs".Syllabus

Témata:

Paradigmata programování, procedurální a objektový přístup;

Program, algoritmus a data;

Data a datové struktury, datové typy implementované a abstraktní;

Algoritmus a jeho vlastnosti, dělení, typologie, formy znázornění;

Základní algoritmické konstrukce;

Prostředky pro zápis algoritmu a programu, diagramy, SW prostředí;

Datové struktury lineární (pole, asociativní pole, fronta, zásobník, seznamy, implementace struktur, datové struktury a operační systémy);

Datové struktury nelineární;

Implementace datových typů (zásobník, fronta, seznamy, grafy, strom) a ukázky;

Příklady vybraných základních algoritmů;

Základní obecné typy algoritmů;

Příklady programovacích jazyků (blokové - Scratch, znakové - Python, Pascal)

Aplikace do edukace.

Annotation

The course Algorithms and Data Structures for Teachers focuses on one of the key components of ICT teacher education, namely the elements of algorithmization and programming, computer thinking and digital literacy. Subsequently, it is possible to continue programming in specific programming languages ​​and use and apply the acquired knowledge.

The aim of the course is to acquaint students with the principles, typology and implementation of algorithmic and data structures, including examples and exercises with algorithmic and data structures. The topics of the course include the following key topics: Paradigms of programming, procedural and object-oriented approach; Program, algorithm and data; Data and data structures, implemented and abstract data types; Algorithm and its properties, division, typology, forms of representation; Basic algorithmic constructions; Means for writing algorithm and program, diagrams, SW environment; Linear data structures (arrays, associative arrays, queues, stacks, lists, structure implementations, data structures and operating systems); Non-linear data structures; Implementation of data types (stack, queue, lists, graphs, tree) and samples; Examples of selected basic algorithms; Basic general types of algorithms; Application to education.