Algorithms Design – KSALDES1KU/2022
Assignments
- 0.0: Kattis intro (can do) (Ended)
- 0.1: Prerequisites (can do) (Ended)
- 0.2 Classics (can do) (Ended)
- Single source shortest path, non-negative weights
- Minimum Spanning Tree
- Knapsack
- Longest Increasing Subsequence
- Minimum Cut
- Maximum Flow
- Polynomial Multiplication 1
- Polynomial Multiplication 2
- 1.0 Stable matching (can do) (Ended)
- 2.0 Greedy (must do >= 2) (Ended)
- Interval Scheduling
- Watering Grass
- Minimum Scalar Product
- Wood Cutting
- Classrooms
- Shopaholic
- Birds on a Wire
- Coloring Socks
- Atlantis
- Profitable Pizzas
- 3.0 Divide and conquer (can do) (Ended)
- 4.0 Dynamic programming (must do >= 2) (Ended)
- Weighted Interval Scheduling
- Exact Change
- BAAS
- Canonical Coin Systems
- Pebble Solitaire
- Peg Solitaire
- Restaurant Orders
- Presidential Elections
- Nested Dolls
- 5.0 Network flow (must do >= 1) (Ended)
- 6.0 Mother of all Make-up Sessions (on demand) (Ended)
Teachers
Nutan Limaye | Teacher |
Thore Husfeldt | Teacher |
Agnes Hardy Bertelsen | Teaching Assistant |
Emil Bak-Møller | Teaching Assistant |
Jakob Israelsen | Teaching Assistant |
Simon Green Kristensen | Teaching Assistant |
Stefan Henriksen | Teaching Assistant |