Algorithms Engineering – INF237/spring24

Assignments

• 1 Introduction (Ended)
1. FizzBuzz
2. Help a PhD candidate out!
3. Ants
4. Stand on Zanzibar
5. Spavanac
• Graph I (Ended)
1. Illiteracy
2. Joint Excavation
3. As Easy as CAB
4. Bowser's Pipes
• Sliding, searching, sorting (Ended)
1. Free Weights
2. Card Trading
3. Reconnaissance
4. Alehouse
• Dynamic Programming I (Ended)
1. Bridge Automation
2. Cutting Brownies
3. Using Digits
4. Narrow Art Gallery
• Graph II (Ended)
1. Arbitrage?
2. Emptying the Baltic
3. Artwork
4. A Walk Through The Forest
• Segment trees (Ended)
1. Mega Inversions
2. Frosh Week
3. Jumping Choreography
4. Just for Sidekicks
• Geometry I (Ended)
1. UnDetected
2. Cleaning Pipes
3. Goat Rope
4. Counting Triangles
• Exponential time and implicit graphs (Ended)
1. Knights in Fen
2. Bag of Tiles
3. Bracket Pairing
4. Basin City Surveillance
• Dynamic programming II (Ended)
1. Errands
2. Company Picnic
3. Bribe
4. Bus Planning
• Flow (Ended)
1. Jupiter Orbiter
2. Tomography
3. Cops and Robbers
4. Paintball
• Geometry II (Ended)
1. Forest Evolution
2. Robot Protection
3. Closest Pair
4. Robert Hood
• Strings (Ended)
1. Automatic Trading
2. Baza
3. Clock Pictures
4. Typo
• Numbers (Ended)
1. Factor-Free Tree
2. Boxes
3. Tourists
4. Pokegene

Teachers