Algorithms Engineering – INF237/spring20

Assignments

• s20-01 Ad hoc (Ended)
1. A Different Problem
2. Guess the Number
3. Kitchen Combinatorics
4. Oddities
5. Turtle Master
• s20-02 Graphs 1 (Ended)
1. A New Adventure
2. Diplomacy
3. The Maze Makers
4. Reversing Roads
• s20-03 Sliding, searching and sorting (Ended)
1. Chasing the Cheetahs
2. Free Weights
3. Room Painting
4. Bumper-To-Bumper Traffic
• s20-04 Dynamic programming 1 (Ended)
1. Chemist's vows
2. Mixing Drinks
3. Restaurant Orders
4. Train Sorting
• s20-05 Graphs 2 (Ended)
1. Gruesome Cave
2. Intelligence Infection
3. Landline Telephone Network
4. Tide Goes In, Tide Goes Out
• s20-06 Segment trees (Ended)
1. Guessing Camels
2. Jumping Choreography
3. Supercomputer
4. Turbo
• s20-07 Geometry 1 (Ended)
1. Colliding Traffic
2. Counting Triangles
3. Jabuke
4. Aquarium Tank
• s20-08 Exponential time algorithms (Ended)
1. Coloring Graphs
2. Page Layout
3. Peg Game for Two
4. Political Development
• s20-09 Dynamic programming 2 (Ended)
1. The Citrus Intern
2. Countdown
3. Journal Editing
4. Rebel Portals
• s20-10 Graphs 3 (Ended)
1. Book Circle
2. Ice Cream
3. Paintball
4. The King of the North
• s20-11 Geometry 2 (Ended)
1. Closest Pair
2. Robot Protection
3. Saint John Festival
4. Simple Polygon
• s20-12 Strings (Ended)
1. Auto Completion
2. Bing It On
3. Clock Pictures
4. Repeated Substrings
• s20-13 Mathematics (Ended)
1. Base-2 Palindromes
2. Factor-Free Tree
3. Semi-prime H-numbers
4. Thermostat Trouble

Teachers