Show:
0 / 0 1. Course info
Friday, 22 August 2025, 00:00 – Thursday, 30 April 2026, 12:00
Assignment | Category | Submissions | Points |
---|---|---|---|
1.1 General | |||
1.2 Video lectures | |||
1.3 Weekly exercises | |||
1.4 Electronic exam | |||
1.5 Grading | |||
1.6 Material | |||
1.7 Support for learning and well-being |
0 / 0 Opens on Monday, 20 October 2025, 00:00 2. Course project
Monday, 20 October 2025, 00:00 – Thursday, 30 April 2026, 12:00
Assignment | Category | Submissions | Points |
---|---|---|---|
2.1 About the course project in general | |||
2.2 Course Project: Beacons of RGB | |||
2.3 How to implement algorithms efficiently (tips for practice) | |||
2.4 Final submission of the course project |
0 / 49 Opens on Monday, 20 October 2025, 00:00 3. Course week 1
Monday, 20 October 2025, 00:00 – Sunday, 26 October 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
3.1 Course week 1 | |||
3.1.1 Algorithm | theory | 0 / 5 | 0 / 2 |
3.1.2 Pseudocode | theory | 0 / 5 | 0 / 2 |
3.1.3 Decrease and conquer | theory | 0 / 5 | 0 / 1 |
3.1.4 Insertion sort | theory | 0 / 5 | 0 / 2 |
3.1.5 From pseudocode to implementation | theory | 0 / 5 | 0 / 2 |
3.1.6 Algorithm efficiency | theory | 0 / 2 | 0 / 1 |
3.1.7 Sharing data among data structures | theory | 0 / 2 | 0 / 3 |
3.1.8 Recursion | theory | 0 / 2 | 0 / 1 |
3.1.9 Learning diary, week 1 | theory | 0 / 4 | 0 / 4 |
3.1.10 Exercise about reading pseudocode | exercise | 0 / 2 | 0 / 6 |
3.1.11 Recursive function | exercise | 0 / 5 | 0 / 7 |
3.1.12 Efficacity of the functions | exercise | 0 / 5 | 0 / 8 |
3.1.13 Insertion Sort | exercise | 0 / 10 | 0 / 10 |
0 / 73 Opens on Monday, 27 October 2025, 00:00 4. Course week 2
Monday, 27 October 2025, 00:00 – Sunday, 2 November 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
4.1 Course week 2 | |||
4.1.1 Divide and conquer - design principle | theory | 0 / 2 | 0 / 3 |
4.1.2 Quicksort | theory | 0 / 2 | 0 / 6 |
4.1.3 Mergesort | theory | 0 / 2 | 0 / 3 |
4.1.4 Algorithm efficiency | theory | 0 / 3 | 0 / 6 |
4.1.5 Asymptotic analysis | theory | 0 / 3 | 0 / 9 |
4.1.6 Learning diary week 2 | theory | 0 / 4 | 0 / 4 |
4.1.7 Quicksort | exercise | 0 / 10 | 0 / 10 |
4.1.8 Mergesort | exercise | 0 / 10 | 0 / 10 |
4.1.9 O-notation | exercise | 0 / 3 | 0 / 6 |
4.1.10 Asymptotic efficiency | exercise | 0 / 5 | 0 / 16 |
4.2 Exercises for the week 2 practice session | |||
4.3 Test submitting your project | |||
4.3.1 Test submitting your project | chapter | 0 / 40 | 0 / 0 |
0 / 37 Opens on Monday, 3 November 2025, 00:00 5. Course week 3
Monday, 3 November 2025, 00:00 – Sunday, 9 November 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
5.1 Course week 3 | |||
5.1.1 Standard Template Library | theory | 0 / 2 | 0 / 1 |
5.1.2 STL containers | theory | 0 / 2 | 0 / 4 |
5.1.3 STL container performance | theory | 0 / 2 | 0 / 1 |
5.1.4 STL iterators | theory | 0 / 2 | 0 / 2 |
5.1.5 STL iterator performance and categories | theory | 0 / 2 | 0 / 1 |
5.1.6 STL algorithms | theory | 0 / 2 | 0 / 2 |
5.1.7 STL examples | theory | 0 / 2 | 0 / 1 |
5.1.8 Lambda-functions | theory | 0 / 2 | 0 / 2 |
5.1.9 Lambda functions and capturing variables | theory | 0 / 2 | 0 / 1 |
5.1.10 Tuning STL algorithms and containers | theory | 0 / 2 | 0 / 2 |
5.1.11 Learning diary week 3 | theory | 0 / 4 | 0 / 4 |
5.1.12 Iterators | exercise | 0 / 2 | 0 / 5 |
5.1.13 STL containers | exercise | 0 / 3 | 0 / 7 |
5.1.14 STL container efficiency | exercise | 0 / 2 | 0 / 4 |
5.2 Exercises for the week 3 practice session |
0 / 65 Opens on Monday, 10 November 2025, 00:00 6. Course week 4
Monday, 10 November 2025, 00:00 – Sunday, 16 November 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
6.1 Course week 4 | |||
6.1.1 Graphs and trees | theory | 0 / 2 | 0 / 2 |
6.1.2 Tree data structures and tree traversals | theory | 0 / 2 | 0 / 2 |
6.1.3 Invalidation | theory | 0 / 2 | 0 / 1 |
6.1.4 Amortized performance | theory | 0 / 2 | 0 / 1 |
6.1.5 Asymptotic performance | theory | 0 / 2 | 0 / 2 |
6.1.6 Increasing the actual performance | theory | 0 / 2 | 0 / 3 |
6.1.7 Randomization | theory | 0 / 2 | 0 / 1 |
6.1.8 Learning diary week 4 | theory | 0 / 4 | 0 / 4 |
6.1.9 Trees | exercise | 0 / 2 | 0 / 8 |
6.1.10 Pre-order traversal | exercise | 0 / 10 | 0 / 10 |
6.1.11 In-order traversal | exercise | 0 / 10 | 0 / 10 |
6.1.12 Post-order traversal | exercise | 0 / 10 | 0 / 10 |
6.1.13 Invalidation | exercise | 0 / 2 | 0 / 3 |
6.1.14 Improved functions and explanations | exercise | 0 / 4 | 0 / 8 |
6.2 Exercises for the week 4 practice session |
0 / 81 Opens on Monday, 17 November 2025, 00:00 7. Course week 5
Monday, 17 November 2025, 00:00 – Sunday, 23 November 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
7.1 Course week 5 | |||
7.1.1 Heap | theory | 0 / 2 | 0 / 3 |
7.1.2 Heap as array | theory | 0 / 2 | 0 / 3 |
7.1.3 Breadth first search, BFS | theory | 0 / 2 | 0 / 1 |
7.1.4 Depth first search, DFS | theory | 0 / 2 | 0 / 1 |
7.1.5 Implementing graphs | theory | 0 / 2 | 0 / 1 |
7.1.6 Learning diary week 5 | theory | 0 / 4 | 0 / 4 |
7.1.7 Heap insert | exercise | 0 / 10 | 0 / 10 |
7.1.8 Heap remove | exercise | 0 / 10 | 0 / 10 |
7.1.9 Heap build | exercise | 0 / 10 | 0 / 10 |
7.1.10 Heapsort | exercise | 0 / 10 | 0 / 10 |
7.1.11 Breadth First Search | exercise | 0 / 10 | 0 / 12 |
7.1.12 Depth First Search | exercise | 0 / 10 | 0 / 12 |
7.1.13 Exercise Maze | exercise | 0 / 2 | 0 / 4 |
7.2 Exercises for the week 5 practice session |
0 / 68 Opens on Monday, 24 November 2025, 00:00 8. Course week 6
Monday, 24 November 2025, 00:00 – Sunday, 30 November 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
8.1 Course week 6 | |||
8.1.1 Weighted graphs | theory | 0 / 2 | 0 / 1 |
8.1.2 Dijkstra's algorithm | theory | 0 / 2 | 0 / 1 |
8.1.3 A*-algorithm | theory | 0 / 2 | 0 / 1 |
8.1.4 Effiency of graph algorithms | theory | 0 / 2 | 0 / 1 |
8.1.5 Hash tables | theory | 0 / 2 | 0 / 8 |
8.1.6 Learning diary week 6 | theory | 0 / 4 | 0 / 4 |
8.1.7 Dijkstra's algorithm | exercise | 0 / 10 | 0 / 20 |
8.1.8 Exercise Dijkstra1 | exercise | 0 / 2 | 0 / 4 |
8.1.9 Exercise Dijkstra2 | exercise | 0 / 2 | 0 / 4 |
8.1.10 Open hashing | exercise | 0 / 10 | 0 / 8 |
8.1.11 Hash tables | exercise | 0 / 2 | 0 / 16 |
8.2 Exercises for the week 6 practice session |
0 / 10 Opens on Monday, 1 December 2025, 00:00 9. Course week 7
Monday, 1 December 2025, 00:00 – Sunday, 7 December 2025, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
9.1 Course week 7 | |||
9.1.1 Binary search trees | theory | 0 / 2 | 0 / 2 |
9.1.2 Balanced binary search trees | theory | 0 / 2 | 0 / 4 |
9.1.3 Learning diary week 7 | theory | 0 / 4 | 0 / 4 |
9.2 Exercises for the week 7 practice session |
0 / 118 10. Points for attendance and watching videos
Sunday, 24 August 2025, 00:00 – Thursday, 30 April 2026, 12:00
exercise
0 / 258
present
0 / 118
theory
0 / 125