This course offering ended 2017-01-16
Problem Solving and Programming Under Pressure – DD2458/popup16
Assignments
- popup16 homework 01 (Ended)
- popup16 homework 02 (Ended)
- popup16 homework 03 (Ended)
- popup16 homework 04 (Ended)
- popup16 homework 05 (Ended)
- popup16 homework 06 (Ended)
- popup16 homework 07 (Ended)
- popup16 homework 08 (Ended)
- popup16 homework 09 (Ended)
- popup16 homework 10 (Ended)
- popup16 homework 11 (Ended)
- popup16 homework 12 (Ended)
- Circle of Debt
- Farey Sequence Length
- Good Coalition
- Herkabe
- An Industrial Spy
- Non-boring sequences
- Moving to Nuremberg
- Rings
- Slikar
- Square Fields (Hard)
- popup16 lab 1 (Ended)
- Linear Equation Solver
- Partial Linear Equation Solver
- Fenwick Tree
- Interval Cover
- Knapsack
- Longest Increasing Subsequence
- Rational Arithmetic
- Union-Find
- popup16 lab 2 (Ended)
- All Pairs Shortest Path
- Eulerian Path
- Maximum Flow
- Minimum Cost Maximum Flow
- Minimum Cut
- Minimum Spanning Tree
- Single source shortest path, non-negative weights
- Single source shortest path, time table
- Single source shortest path, negative weights
- popup16 lab 3 (Ended)
- Chinese Remainder
- Chinese Remainder Theorem (non-relatively prime moduli)
- Linear Recurrences
- Modular Arithmetic
- Prime Sieve
- String Matching
- String Multimatching
- Suffix Sorting
- popup16 lab 4 (Ended)
- Closest Pair (Uniform)
- Closest Pair
- Convex Hull
- String Hashing
- Maximum Number of Colinear Points
- Point in Polygon
- Polygon Area
- Line Segment Distance
- Line Segment Intersection
- popup16 problem session 1 (Ended)
- popup16 problem session 2 (Ended)
- popup16 problem session 3 (Ended)
- popup16 problem session 4 (Ended)
Teachers
Johan Sannemo | Teaching Assistant |
Per Austrin | Teaching Assistant |