[ 201COMAAUDV18 ] VL Algorithms and data structures

(*) Unfortunately this information is not available in english.
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS B2 - Bachelor's programme 2. year Mathematics Carsten Schneider 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2019W
Objectives Algorithms and data structures will be presented that enable one to represent basic mathematical objects with the computer. Ideally, these algorithms/data structures can be combined in order to solve complex mathematical problems.
  • Fundamental terms (algorithm, data structure, data type, abstract data type)
  • Basic data structures (stack, queue, linked list, tree)
  • Representation of sets (linked list, hash function, binary search tree, AVL tree)
  • Representation of polynomials (dense, sparse)
  • Sorting algorithms
  • Graph algorithms
Criteria for evaluation written exam at the end of the lecture
Methods Blackboard and slides. In addition, homeworks are posed in the lecture that will be discussed in the exercise class.
Language (*)English
Study material The lecture is based in parts on Datenstrukturen und Algorithmen von R.H. G"uting und S. Dieker (Teubner, 2003)
Changing subject? No
Further information For further details see also
Corresponding lecture (*)TM1PEKVADAT: KV Algorithmen und Datenstrukturen (3 ECTS)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment