Algorithms Design – KSALDES1KU/KSALDES1KU-2020
Assignments
- Classics (non-mandatory) (Ended)
- Knapsack
- Longest Increasing Subsequence
- Minimum Spanning Tree
- Single source shortest path, non-negative weights
- Prerequisites (non-mandatory) (Ended)
- 1: Kattis intro (non-mandatory) (Ended)
- 2: Greedy (need 1 accepted) (Ended)
- Interval Scheduling
- Watering Grass
- Minimum Scalar Product
- Wood Cutting
- Classrooms
- Shopaholic
- Birds on a Wire
- Coloring Socks
- Atlantis
- Profitable Pizzas
- 3: Dynamic programming (need 1 accepted) (Ended)
- Weighted Interval Scheduling
- Exact Change
- BAAS
- Peg Solitaire
- Canonical Coin Systems
- Restaurant Orders
- Presidential Elections
- Nested Dolls
- 3.1: Dynamic programming make-up (need 1 accepted) (Ended)
- 4: Network flow (need 1 accepted) (Ended)
- 5: All of the above (need 2 accepted) (Ended)
- Open-Pit Mining
- Canonical Coin Systems
- Yet Satisfiability Again!
- Equal Sums (Easy)
- Single source shortest path, negative weights
- Single source shortest path, time table
- Arbitrage?
- Knapsack
- Robots on a Grid
- RA Duty Scheduler
- Longest Increasing Subsequence
- Moving Pianos
- Halloween Loot
- 4.1 Network flow make-up (need 1 accepted) (Ended)
Teachers
Thore Husfeldt | Teacher |
Christian Lebeda | Teaching Assistant |
Mikkel Andersen | Teaching Assistant |