[ INBIPVOALG1 ] VL Algorithms and Data Structures 1

(*) Unfortunately this information is not available in english.
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 Computer Science 2021S
Objectives Students are able to think algorithmically. They know the basic static and dynamic data structures, the most important sorting and search algorithms, and the concepts of recursion and random numbers. Furthermore, they are able to analyze the complexity of algorithms with respect to runtime and memory requirements.
Subject Programming language is Java. Topics are:

  • Complexity
  • Lists/Stacks/Queues
  • Recursion
  • Backtracking
  • Trees
  • Heaps, Priority Queues
  • Sorting
  • Digital Sorting
  • Strings and Patterns
  • Random Numbers
  • Randomized Algorithms
Criteria for evaluation Exam at the end of term
Methods Slide-based presentation
Language German
Study material Slides will be available in the course section in Moodle. Additional literature will be announced in the course.
Changing subject? No
Further information
Corresponding lecture (*)INBPDVOALG1: VO Algorithmen und Datenstrukturen 1 (3 ECTS) oder 289ALDSAD1V16: VL Algorithmen und Datenstrukturen 1 (3 ECTS)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment