Welcome to HY 2024–2025 — University of Helsinki course CSM14212 Programming Parallel Computers, 2024–2025!
This course is intended for University of Helsinki students. Please read the course website for more information. Join the Discord channel here. To get credits for this course, contact Antti Laaksonen.
You can try to solve the following exercises. For full points, please submit your solution before the deadline; for partial points you can still try to submit until the course ends. Resubmissions are always safe; you will never lose points if you resubmit something (but if you resubmit after the deadline, you will not get full points that way, either).
| Task | Attempts | Points | Max | Rating | Man. | Deadline for full points |
|---|---|---|---|---|---|---|
| Pre — prerequisite test | ||||||
| Pre0 | – | – | 1 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| CP — correlated pairs | ||||||
| CP1 | – | – | 5 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| CP2a | – | – | 3 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| CP2b | – | – | 3 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| CP2c | – | – | 3 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| CP3a | – | – | 5 + 0 | ★★ | M | 2025-08-31 at 23:59:59 |
| CP3b | – | – | 5 + 0 | ★★ | M | 2025-08-31 at 23:59:59 |
| CP4 | – | – | 5 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| CP5 | – | – | 10 + 0 | ★★ | M | 2025-08-31 at 23:59:59 |
| CP9a | – | – | 5 + 0 | ★★★ | M | 2025-08-31 at 23:59:59 |
| IS — image segmentation | ||||||
| IS2 | – | – | 5 + 0 | ★★ | M | 2025-08-31 at 23:59:59 |
| IS4 | – | – | 5 + 0 | ★★ | M | 2025-08-31 at 23:59:59 |
| IS6a | – | – | 5 + 0 | ★★★ | M | 2025-08-31 at 23:59:59 |
| IS6b | – | – | 5 + 0 | ★★ | M | 2025-08-31 at 23:59:59 |
| IS9a | – | – | 5 + 0 | ★★★ | M | 2025-08-31 at 23:59:59 |
| MF — median filter | ||||||
| MF1 | – | – | 5 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| MF2 | – | – | 3 + 0 | ★ | M | 2025-08-31 at 23:59:59 |
| MF9a | – | – | 5 + 0 | ★★★ | M | 2025-08-31 at 23:59:59 |
| SO — sorting | ||||||
| SO4 | – | – | 5 + 0 | ★+ | M | 2025-08-31 at 23:59:59 |
| SO5 | – | – | 5 + 0 | ★+ | M | 2025-08-31 at 23:59:59 |
| SO6 | – | – | 5 + 0 | ★★★ | M | 2025-08-31 at 23:59:59 |
| LLM — large language model | ||||||
| LLM9a | – | – | 5 + 2 | ★★ | M | 2025-08-31 at 23:59:59 |
| X — extra | ||||||
| X0a | – | – | 0 + 0 | M | 2025-08-31 at 23:59:59 | |
| X0b | – | – | 0 + 0 | M | 2025-08-31 at 23:59:59 | |
| X9a | – | – | 1 + 0 | + | M | 2025-08-31 at 23:59:59 |
| Total | – | – | 104 + 2 | |||
“Points” — the points scored by your submissions according to automatic grading, or the amount given by our course staff after manual review.
“Man.” = mandatory tasks — while you are free to solve any of the exercises in any order, you must have at least one point from each of these tasks in order to complete the course.
“Rating” — an approximate indication of how much effort is needed for getting full points in each exercise. 1-star problems are easy to solve without too much effort, typically with less than 100 lines of code. 2-star problems may require a careful application of the ideas presented in the course material and plenty of experimentation, and a solution is typically more than 100 lines of code. 3-star problems are small research projects. Please note that in many of the exercises it is often much easier to get some points than full points.
This course is graded as follows:
| Points | Grade |
|---|---|
| ≥ 69 | 5 |
| ≥ 62 | 4 |
| ≥ 54 | 3 |
This course closes on 2025-08-31 at 23:59:59 (Helsinki), i.e., in 247 days and 5 hours. After the course closes, you can no longer submit (or resubmit) anything for grading.