[ MEBPFVOPIN2 ] VL Data Structures

(*) Unfortunately this information is not available in english.
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS B3 - Bachelor's programme 3. year Computer Science Hanspeter Mössenböck 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Mechatronics 2015W
Objectives Familiarity with common algorithms and data structures in Computer Science with an emphasis on dynamic data structures. Training of algorithmic thinking. Consolidation of Java programming practice.
  • Lists (singly linked/doubly linked, sorted/unsorted, linear lists/ring lists)
  • trees (binary search trees, tree balancing, 234 trees, red-black trees, B-trees, heaps)
  • graphs (representation, depth-first-search, breadth-first-search, minimal spanning trees, shortest paths, transitive closure of graphs, input/output of graphs)
  • Hash tables
  • string search (brute force, Boyer-Moore algorithm, searching with regular expressions)
  • advances sorting algorithms (heap sort, sorting of linked lists, sorting of external files, topological sorting)
  • overview of the Java class library
Criteria for evaluation Written exam at the end of the semester.
Methods Presentation on the blackboard and on slides.
Language German
Study material see
Changing subject? No
Further information none
Corresponding lecture (*)ME1PEVOPIDS: VO Praktische Informatik: Datenstrukturen (3 ECTS)
On-site course
Maximum number of participants -
Assignment procedure Assignment according to sequence