Přístupnostní navigace
E-application
Search Search Close
Course detail
FEKT-BPC-ALDAcad. year: 2019/2020
The first part of the course is focused on introducing students to the basic concepts: algorithm, time and memory complexity of the algorithm, data container / collection.The second part of the course deals with the concepts: abstract data type: (Vector, Stack, Queue, Set, Tree) and the use of iterators for these data types.In the third part, students will learn about recursive and non-recursive algorithms, sorting and searching algorithms.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading
Classification of course in study plans
branch EE-FLE , 1 year of study, summer semester, compulsory
Lecture
Teacher / Lecturer
Syllabus
Exercise in computer lab