Algorithms Engineering – INF237/spring2023

Assignments

• Introduction (Ended)
1. Stuck In A Time Loop
2. R2
3. Missing Numbers
4. ASCII Figure Rotation
5. Work Reduction
• Graphs 1 (Ended)
1. Reactivity Series
2. Fire
3. Conservation
4. Joint Excavation
• Sliding, searching, and sorting (Ended)
1. Divisible Subsequences
2. The Sound of Silence
3. Reconnaissance
4. Mali
• Dynamic programming 1 (Ended)
1. Nine Packs
2. A Multiplication Game
3. Painting a Fence
4. Bicikli
• Graphs 2 (Ended)
1. Bridges and Tunnels
2. Conquest
3. Single source shortest path, time table
4. Treasure Hunt
• Segment Trees (Ended)
1. Supercomputer
2. Bridging Signals
3. Guessing Camels
4. Excellent Engineers
• Geometry 1 (Ended)
1. Polygon Area
2. Rounded Buttons
3. Molecules
4. The Agglomerator
• Exponential time algorithms (Ended)
1. Exam Manipulation
2. Geppetto
3. Flashing Fluorescents
4. Bracket Pairing
• Dynamic programming 2 (Ended)
1. Company Picnic
2. Paths
3. Bus Planning
4. SMS Typing
• Graphs 3 (Ended)
1. Gopher II
2. Cops and Robbers
3. Waif Until Dark
4. Landscaping
• Geometry 2 (Ended)
1. Simple Polygon
2. Largest Triangle
3. Closest Pair
4. Lipschitz Constant
• Strings (Ended)
1. Power Strings
2. Stammering Aliens
3. Typo
4. Baza
• Trees Queries and Numbers (Ended)
1. Tourists
2. Tree Insertion
3. Iks
4. Pokegene

Teachers