Algorithms Engineering – INF237/spring25

Assignments

• 1 Introduction (Ended)
1. Autori
2. Pizza Crust
3. Keyboardd
4. Fishmongers
5. Contest Struggles
• 2 Graph I (Ended)
1. Reversing Roads
2. Fire
3. Breaking Bad
4. Conservation
• 3 Sliding, searching, sorting (Ended)
1. Nested Dolls
2. Ljutnja
3. Tree Shopping
4. Martian DNA
• 4 Dynamic Programming I (Ended)
1. Nikola
2. Word Clouds Revisited
3. Presidential Elections
4. Spiderman's Workout
• 5 Graph II (Ended)
1. Nature Reserve
2. Emptying the Baltic
3. Tima goes to Xentopia
4. Landline Telephone Network
• 6 Segment trees (Ended)
1. Modulo Data Structures
2. Turbo
3. Movie Collection
4. Knockout Tournament
• 7 Geometry I (Ended)
1. Hidden Camera
2. Pesky Mosquitoes
3. Jabuke
4. Glyph Recognition
• 8 Exponential time and implicit graphs (Ended)
1. Map Colouring
2. Basin City Surveillance
3. Bracket Pairing
4. Holey N-Queens (Batman)
• 9 Dynamic Programming II (Remaining: 1 day 3:51:47)
1. Bus Planning
2. The Citrus Intern
3. Cat in a tree
4. Errands
• 10 Flow (Remaining: 9 days 3:51:47)
1. The King of the North
2. Landscaping
3. Paintball
4. Transportation Delegation
• 11 Geometry II (Remaining: 19 days 4:51:47)
1. Saint John Festival
2. Forest Evolution
3. Closest Pair
4. Dart Scoring
5. Fence Fee
• 12 Strings (Start: 2025-04-14 16:00 CEST)
• 13 Numbers and trees (Start: 2025-04-21 16:00 CEST)

Teachers