Algorithms Engineering – INF237/spring18

Assignments

• s18-01 Testing the System (Ended)
1. Bard
2. Guess the Number
3. Oddities
4. Seven Wonders
5. Take Two Stones
• s18-02 Graph exploration (Ended)
1. A Mazing!
2. Birthday Party
3. Brexit
4. Getting Gold
• s18-03 Sliding, searching and sorting (Ended)
1. Distributing Ballot Boxes
2. Mountain Village
3. Nested Dolls
4. Pivot
• s18-04 Dynamic programming 1 (Ended)
1. Maximizing (And Minimizing) Your Winnings
2. Memory Game
3. Muzicari
4. Train Sorting
• s18-05 Graph algorithms (Ended)
1. Full Tank?
2. Hotels
3. Island Hopping
4. Speedy Escape
• s18-06 Segment trees (Ended)
1. Knockout Tournament
2. Supercomputer
3. Toll
4. Turbo
• s18-07 Geometry 1 (Ended)
1. Glyph Recognition
2. Hidden Camera
3. Hole in One
4. Imperfect GPS
• s18-08 Exponential time algorithms (Ended)
1. Basin City Surveillance
2. Coloring Graphs
3. Map Colouring
4. Rubik's Revenge in ... 2D!? 3D?
• s18-09 Dynamic programming 2 (Ended)
1. Ascending Photo
2. The Citrus Intern
3. Hiding Chickens
4. Square Fields (Hard)
• s18-10 Flows and bipartite matchings (Ended)
1. Cat vs. Dog
2. Paintball
3. Risk
4. The King of the North
• s18-11 Geometry 2 (Ended)
1. Closest Pair
2. Cover up
3. Fence Orthogonality
4. Board Wrapping
• s18-12 String algorithms (Ended)
1. Bless You Autocorrect!
2. Bing It On
3. Clock Pictures
4. Power Strings
5. String Matching
6. Repeated Substrings
• s18-13 Number theory (Ended)
1. Factor-Free Tree
2. How Many Digits?
3. I Hate The Number Nine
4. Blackboard Numbers

Teachers