Inhalt

[ 977PADMAMEU25 ] IK Algorithmics and Mathematics for Economic and Business Analytics

Versionsauswahl
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS M1 - Master's programme 1. year Business Administration Markus Sinnl 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Master's programme Economic and Business Analytics 2025W
Learning Outcomes
Competences
Problem-solving: Students can abstract practical problems as mathematical models and solve them. They know how to write down their problems in a formally concise way. They know how to approach the problems by mathematical and algorithmic means.
Skills Knowledge
  1. Learning Outcome 4 (LO4): Analyze, apply and design basic sorting and graph algorithms
  2. Learning Outcome 5 (LO5): Find optima of differentiable functions
  3. Learning Outcome 6 (LO6): Solve systems of linear equations
  1. Learning Outcome 1 (LO1): Understand the basic concepts of algorithm design
  2. Learning Outcome 2 (LO2): Understand foundations of logic, analytics, and linear algebra
  3. Learning Outcome 3 (LO3): Understand how to apply mathematical concepts to formalize and solve problems from the fields of economics and business analytics

Course Content

  • Part 1: Algorithms
  1. Sorting algorithms
  2. Big O-notation and complexity
  3. Graphs and basic graph algorithms
  4. Shortest-path and spanning tree algorithms
  • Part 2: Mathematics
  1. Logic
  2. Sequences
  3. Limits of functions
  4. Continuity
  5. Differentiability
  6. Optima of functions
  7. Basics of linear algebra
Criteria for evaluation Regular homework exercises that must be submitted online via Moodle. The homework exercises are worth 30 points. Exam at the end of the semester with 70 points. At least 35 points on the exam are needed to pass the course. There is a possibility to repeat it in case of negative results or scheduling issues (retry exam). The exam consists of programming tasks. It lasts 90 minutes.

Final grades will be given as follows:

PointsGrade
87.5 - 100.01
75.0 - 87.02
62.5 - 74.53
50 - 62.04
0.0 - 49.55

Both the homework exercises and the exam cover all the learning outcomes

Methods The course uses a combination of different teaching methods in order to

  1. maximize the motivation and attention of the students.
  2. address the learning objectives in the didactically best way.

This includes the following

  • Teacher-centred information inputs, supported by slides and literature
  • Development of content in collaboration with the students on the computer and the black board
  • Development of solutions to exercise problems in groups, followed by joint discussions with the whole group
Language English
Study material
  • Slides
  • In-class programming exercises with solutions
  • Reading material
    • Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, current edition, MIT Press
    • Celia, Nice, Elliott Advanced Mathematics
  • Pointers to additional literature

(All content is provided via Moodle)

Changing subject? No
On-site course
Maximum number of participants 30
Assignment procedure Assignment according to priority