Max Flow Image

Algorithmen und Wahrscheinlichkeit

G-09

Ahmet Ala
ahmet.ala@inf.ethz.ch
ahmetala
HG G26.5
Thursdays 16:15-18:00

Schedule

  • Last Minitest

    Date: Thursday, 23 May

    Time: 16:15

  • Exam

    Date: Tuesday, 6 August

    Time: 10:00 - 13:00

    Location: ONA & Zentrum

Release Date Task Description Solution Code Original Problem Difficulty Category
2024-04- Hard DP + Expected Value + Primality
2024-04- Medium Graphs
2024-04-16 Taking Balls Solution Code Sushi Hard DP + Expected Value
2024-04-11 Task Solution Code to Task
Code to Dice Product 3 		Dice Product 3 Medium DP + Expected Value

  • This is a list of programming tasks relevant to the course content
  • If you are done with the exercises in the Code Expert, got bored and looking for more practice(in the summer), you can try these.
  • Hard Tasks are probably above the difficulty level of the programming exam, but they are good practice.
  • The content of the graph algorithms is what you've learned in "Algorithms and Probability," including Eulerian/Hamiltonian paths, bipartite matching, max flow, etc.