[ 201LOSDDAAV13 ] VL Design and Analysis of Algorithms

(*) 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 Mathematics Heinrich Rolletschek 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2013W
Objectives Students should get acquainted with

  • a number of typical algorithms in various areas of mathematics,
  • general principles underlying the design of such algorithms,
  • methods for complexity analysis.
Subject An introductory chapter deals with general notions and principles concerning algorithms and complexity, like worst-case and average complexity, asymptotic complexity etc. Then algorithms in areas like sorting, graph problems and arithmetic are presented. Except for the last of these topics the emphasis lies on material not covered by other RISC-courses; in particular no advanced topics from Computer Algebra are dealt with. General principles of algorithm design, like recursion or dynamic programming, are introduced as needed.
Criteria for evaluation Written or oral exam.
Language English if requested, otherwise German
Study material
  • Lecture notes
  • S. Baase: Computer Algorithms. Introduction to Design and Analysis.
  • A. Aho, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms
  • T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein: Introduction to Algorithms
Changing subject? No
Further information Necessary knowledge: Knowledge of some ALGOL-like programming language, some elementary knowledge in the area of analysis.
Corresponding lecture (*)TM1WIVOEAAL: VO Entwurf und Analyse von Algorithmen (3 ECTS)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment