This course offering will end 2024-06-03
Problem Solving and Programming Under Pressure – DD2458/popup24
Assignments
- homework 1 (Remaining: 34 days 12:36:45)
- lab 1 (Ended)
- Interval Cover
- Knapsack
- Longest Increasing Subsequence
- Union-Find
- Fenwick Tree
- Rational Arithmetic
- Polynomial Multiplication 2
- Linear Equation Solver
- Partial Linear Equation Solver
- homework 2 (Remaining: 34 days 12:36:45)
- homework 3 (Remaining: 34 days 12:36:45)
- problem session 1 (Ended)
- lab 2 (Ended)
- Single source shortest path, non-negative weights
- Single source shortest path, time table
- Single source shortest path, negative weights
- All Pairs Shortest Path
- Minimum Spanning Tree
- Maximum Flow
- Minimum Cut
- Minimum Cost Maximum Flow
- Eulerian Path
- homework 4 (Remaining: 34 days 12:36:45)
- homework 5 (Remaining: 34 days 12:36:45)
- homework 6 (Remaining: 34 days 12:36:45)
- problem session 2 (Ended)
- Bond
- Colourful Graph
- Dots and Boxes
- Escape from Enemy Territory
- Jurassic Jigsaw
- Moveable maze
- Taxi Cab Scheme
- lab 3 (Ended)
- String Matching
- String Multimatching
- Suffix Sorting
- Modular Arithmetic
- Chinese Remainder
- Chinese Remainder Theorem (non-relatively prime moduli)
- Prime Sieve
- Linear Recurrences
- homework 7 (Remaining: 34 days 12:36:45)
- homework 8 (Remaining: 34 days 12:36:45)
- homework 9 (Remaining: 34 days 12:36:45)
- problem session 3 (Ended)
- Automatic Trading
- Dunglish
- Gladiators
- Semi-prime H-numbers
- Indoorienteering
- Remainder Reminder
- Sum and Product
- lab 4 (Remaining: 7 days 7:36:45)
- String Hashing
- Polygon Area
- Point in Polygon
- Line Segment Intersection
- Line Segment Distance
- Closest Pair (Uniform)
- Closest Pair
- Convex Hull
- Maximum Number of Colinear Points
- homework 10 (Remaining: 34 days 12:36:45)
- homework 11 (Remaining: 34 days 12:36:45)
- homework 12 (Start: 2024-05-07 19:00 CEST)
Teachers
| Per Austrin | Teacher |