[ 536COSCAD1V19 ] VL Algorithms and Data Structures 1

Es ist eine neuere Version 2021W dieser LV im Curriculum Bachelor's programme Artificial Intelligence 2023W vorhanden.
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS B1 - Bachelor's programme 1. year Computer Science Alois Ferscha 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Artificial Intelligence 2019W
Objectives The term "algorithm" is central to the technically oriented fundamental work in computer science. Every problem is preceded by the formulation of a generally valid, unambiguous, formalized and "executable" rule (algorithm) - every program is an algorithm formulated and noted as a finite text. The main objective of this course is to present proven construction principles and development methods on selected classes of problems and algorithms and thus to develop methodological and decision-making competence: A general "constructive theory" for the generation of an optimal solution algorithm (for a problem recognized as solvable and for a given execution model) does not exist so far. Thus, algorithm construction still represents practical engineering work (or the "art of engineering"), the quality of which is derived from the knowledge of many proven algorithms or their transformation, integration and combination. For this reason, no taxative treatment of punctual solutions for punctual problems is presented. The focus lies rather in a variety of methods, conclusions by analogy, combination of solutions, abstraction and simplification are emphasized.
Subject Algorithm analysis, Abstract data structures, Trees, Recursions, Exhaustion, Sorting and searching, Text processing, Random numbers, Randomized algorithms
Criteria for evaluation Written exam
Methods Slide-based presentation
Language English
Study material The slides and supplementary documents are available for download on our server (; registration required). References to further literature are included.
Changing subject? No
Further information
On-site course
Maximum number of participants -
Assignment procedure Direct assignment