TDDD95 Algorithmic Problem Solving
Problem solving sessions
Problem Solving Sessions
The course has four problem solving sessions, each consisting of six problems that should be solved during 200 minutes (the remaining time is used for discussing the problems). The purpose of the problem solving sessions is to:
- Use algorithm design techniques such as greedy algorithms, dynamic programming, divide and conquer, and search to construct algorithms to solve given problems.
- Quickly and correctly implement algorithms and data structures.
- Effectively test and debug algorithms and data structures.
Each problem solved during a problem solving session gives 2 points towards the grade on LAB1. No points are given for solving the problems outside the session. Only the results from the two best individual problem solving sessions. You may replace problem solving sessions with participation in real programming contests, e.g. KTH Challenge, LiU Challenge or NCPC. If you replace a problem solving session, we will determine individually how many points your result gives. Contact the course staff if you want to use this opportunity.
The problems for the problem solving sessions will be available on Kattis at the start of each session (see links below). The first session is a practice session. Your result in this session does not count towards passing the course, but you are recommended to participate in order to familiarize yourself with the Kattis environment.
Problem Solving Sessions in VT1
- Jan 18 13.10-17.00, Practice problem solving session
- Feb 15 13.10-17.00, Individual problem solving session based on Lab 1 and Exercises 1-4
- Mar 7 13.10-17.00, Individual problem solving session based on Lab 2 and Exercises 5-7
Problem Solving Sessions in VT2
- Apr 22 13.10-17.00, Individual problem solving session based on Lab 3 and Exercises 8-10
- May 13 13.10-17.00, Individual problem solving session based on Lab 4 and Exercises 11-13
Page responsible: Fredrik Heintz
Last updated: 2024-01-05