1DL201, Uppsala universitet
Program Design and Data Structures
10 modules to a pass.
Start freeThe first module is free
Not given in the 2026/27 academic year according to the university. For you who are resitting the exam.
What usually comes up on the exam
- Graphs and graph search5pts
- Trees and recursive data types5pts
- Abstract data types5pts
- IO in practice: do notation, loops and arrays (Haskell)3pts
- Type classes, side effects and random numbers (Haskell)3pts
- Invariants, red-black trees and complexity3pts
- Heaps and binomial heaps2pts
- Testing and debugging2pts
- Evaluation, recursion and higher-order functions2pts
- Lists, list abstractions and streams2pts
- Growth, recurrences and memoization2pts
- Program design: specification, variant and bluffing2pts
- State, arrays and sorting2pts
- Hash tables2pts
- Pass mark
- 17 of 40 points
- Study to a pass
- 11–43 hours
Start with the first module today.
Start freeNo card needed
Common questions about 1DL201
What does it take to pass 1DL201?
The pass mark is 17 of 40 points on the exam.
What usually gives the most points on the 1DL201 exam?
Most points usually come from Graphs and graph search (5 pts), Trees and recursive data types (5 pts), and Abstract data types (5 pts).
Are there past exams for 1DL201?
Yes. 5 previous exams lie behind the course. The exams are not published here, but every kind of question that usually comes up is there to practise.
How long does it take to study for a pass in 1DL201?
From zero it takes about 11–43 hours to a pass.
Does it cost anything?
The first module is free, no card needed. The whole course is included in StudyHub Plus for 99 kr/month, with no lock-in.