Algorithms Engineering – INF237/spring17

Assignments

• 01 - Testing the system (Ended)
1. A Different Problem
2. Pizza Crust
3. Take Two Stones
• 02 - Graph Searching (Ended)
1. Amanda Lounges
2. Coast Length
3. Money Matters
• 03 - Sliding Windows and Searching (Ended)
1. Building Fences
2. Nested Dolls
3. Bobbin Hood
• 04 - Dynamic Programming 1 (Ended)
1. Outing
2. Pebble Solitaire
3. Spiderman's Workout
4. Tri Tiling
• 05 - Graph Algorithms (Ended)
1. Arctic Network
2. Get Shorty
3. A Walk Through The Forest
• 06 - Counting Trees (Ended)
1. Mega Inversions
2. Movie Collection
3. Worst Weather Ever
• 07 - Geometry 1 (Ended)
1. Jabuke
2. Pesky Mosquitoes
3. White Water Rafting
• 08 - Exponential Time Algorithms (Ended)
1. Gokigen Naname
2. Holey N-Queens (Batman)
3. Rubik's Revenge in ... 2D!? 3D?
• 09 - Dynamic Programming 2 (Ended)
1. Allergy Test
2. The Citrus Intern
3. Hiding Chickens
• 10 - Flows and Matchings (Ended)
1. Elementary Math
2. Paintball
3. The King of the North
• 11 - Geometry 2 (Ended)
1. Hole in One
2. Robert Hood
3. Simple Polygon
• 12 - Number Theory (Ended)
1. Divisible Subsequences
2. An Industrial Spy
3. Prime Path
• 13 - String Algorithms (Ended)
1. Code Theft
2. What Does It Mean?
3. Phone List

Teachers