Algorithms Engineering – INF237/spring21

Assignments

• Introduction (Ended)
1. A Different Problem
2. Final Exam
3. Take Two Stones
4. Fountain
5. Nered
• Graphs 1 (Ended)
1. BAAS
2. Money Matters
3. Bowser's Pipes
4. Reversing Roads
• Sliding, searching, and sorting (Ended)
1. Crusaders of the Lost Mark
2. Inquiry I
3. Chasing the Cheetahs
4. Card Trading
• Dynamic programming 1 (Ended)
1. Constrained Freedom of Choice
2. Witchwood
3. Excavator Expedition
4. Train Sorting
5. Knapsack
• Graphs 2 (Ended)
1. Bridges and Tunnels 2
2. Bridges and Tunnels
3. Coffee Date
4. Landline Telephone Network
• Segment trees (Ended)
1. Just for Sidekicks
2. Points of Snow
3. Guessing Camels
4. Movie Collection
• Geometry 1 (Ended)
1. Counting Triangles
2. Imperfect GPS
3. Cutting Corners
4. Pesky Mosquitoes
• Exponential time algorithms (Ended)
1. Coloring Graphs
2. Wedding
3. Social Advertising
4. Tight-Fit Sudoku
• Dynamic programming 2 (Ended)
1. Errands
2. Bribe
3. Protecting the Collection
4. The Citrus Intern
• Graphs 3 (Ended)
1. Moving Pianos
2. Water
3. Landscaping
4. Paintball
• Geometry 2 (Ended)
1. Finding Lines
2. Dart Scoring
3. Simple Polygon
4. Skyline
• Strings (Ended)
1. Typo
2. Burrows-Wheeler
3. String Matching
4. Clock Pictures
• Mathematics (Ended)
1. Intergalactic Mortgage
2. Name That Permutation
3. Blackboard Numbers
4. Sums

Teachers