Problem Solving and Programming Under Pressure – DD2458/popup25
Assignments
- Homework 1: Warmup (Remaining: 63 days 20:46:08)
- 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: Data Structures (Remaining: 63 days 20:46:08)
- Homework 3: Arithmetic (Remaining: 63 days 20:46:08)
- 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: Dynamic Programming (Remaining: 63 days 20:46:08)
- Homework 5: Graphs I (Remaining: 63 days 20:46:08)
- Homework 6: Graphs II (Remaining: 63 days 20:46:08)
- Problem Session 2 (Ended)
- Lab 3 (Remaining: 3 days 15:46:08)
- String Matching
- String Multimatching
- Suffix Sorting
- Modular Arithmetic
- Chinese Remainder
- Chinese Remainder Theorem (non-relatively prime moduli)
- Prime Sieve
- Linear Recurrences
- Homework 7: Strings and String Matching (Remaining: 63 days 20:46:08)
- Homework 8: Combinatorics and Number Theory (Remaining: 63 days 20:46:08)
- Homework 9: Combinatorial Search (Start: 2025-04-01 19:00 CEST)
- Lab 4 (Start: 2025-04-04 19:00 CEST)
- Homework 10: Hashing (Start: 2025-04-15 19:00 CEST)
- Homework 11: Computational Geometry (Start: 2025-04-29 19:00 CEST)
- Homework 12: Goodie Bag (Start: 2025-05-06 19:00 CEST)
Teachers
Per Austrin | Teacher |