Login is required to submit assignments, but you may anonymously explore the course material.

Course news

Pinned news item on top of the list

Project: Hike-and-seek

Grading 

grade= math.round(points/1000)

A couple of examples of rounding to a grade, provided that all pass criteria is OK:

  • 3500p → grade 4
  • 3499p → grade 3
  • 850p → grade 1
  • 849p → grade 0 (an exception to the formula due to the pass criteria)

Show:

0 / 0 1. Material and info

Monday, 28 October 2024, 00:00 – Friday, 6 December 2024, 23:59

Assignment Category Submissions Points
2.1 Git and Gitlab
2.2 Hello Gitlab
2.2.1 Clone the git repo exercises 0 / 10
2.3 Course-upstream to pull new instructions
2.3.1 Set the course-upstream exercises 0 / 10

Monday, 21 October 2024, 00:00 – Sunday, 3 November 2024, 23:59

Assignment Category Submissions Points
4.1 Course topics 3 and 4
4.1.1 Divide and conquer _theory 0 / 4
4.1.2 Quicksort _theory 0 / 8
4.1.3 Mergesort _theory 0 / 8
4.1.4 Questions about this week's lecture videos _theory 0 / 5
4.1.5 Big-O, -Omega and -Theta _theory 0 / 12
4.1.6 Best, worst and average case _theory 0 / 4
4.1.7 Algorithm efficiency for mergesort and quicksort _theory 0 / 4
4.1.8 Questions about this week's lecture videos _theory 0 / 5
4.2 Course topic 3 exercises
4.2.1 Exercise Performance exercises 0 / 40
4.2.2 Sum as a recursion exercises 0 / 10
4.2.3 Digit sum as a recursion exercises 0 / 10
4.3 Course topic 4 exercises
4.3.1 searchSmallestMissingIteration() exercises 0 / 20
4.3.2 searchSmallestMissing() exercises 0 / 20
4.3.3 Quicksort exercises 0 / 20
4.3.4 Mergesort exercises 0 / 20
4.4 Programming project 1
4.4.1 Project 1 documentation
4.4.2 Prg1 starting exercises
4.4.2.1 Orientation exercises 0 / 40
4.4.2.2 Exercise testing exercises 0 / 80
4.5 Session activity
4.5.1 Activity exercises 0 / 30
4.6 Attendance and participation on the weekly exercise session
4.6.1 Weekly exercise session exercises 0 / 25

Monday, 28 October 2024, 00:00 – Sunday, 10 November 2024, 23:59

Assignment Category Submissions Points
5.1 Course topics 5, 6 and 7
5.1.1 Standard template library (STL) _theory 0 / 4
5.1.2 STL Containers _theory 0 / 4
5.1.3 STL container performance _theory 0 / 4
5.1.4 STL iterators _theory 0 / 4
5.1.5 Iterator performance and categories _theory 0 / 4
5.1.6 Questions about this week's lecture videos _theory 0 / 5
5.1.7 STL algorithms _theory 0 / 4
5.1.8 Examples using STL algorithms _theory 0 / 4
5.1.9 Lambda functions _theory 0 / 4
5.1.10 Lambda functions and variable captures _theory 0 / 4
5.1.11 Tuning STL algorithms and containers _theory 0 / 4
5.1.12 Questions about this week's lecture videos _theory 0 / 5
5.2 Course topic 5 exercises
5.2.1 big-O exercises 0 / 30
5.2.2 Exercise Asymptotic exercises 0 / 50
5.2.3 Drilling algorithms & complexities exercises 0 / 20
5.3 Course topic 6 exercises
5.3.1 Iterators exercises 0 / 32
5.3.2 STL containers exercises 0 / 48
5.3.3 Drilling asymptotic exercises 0 / 15
5.3.4 Drill iteration exercises 0 / 20
5.4 Course topic 7 exercises
5.4.1 STL-algorithm 1, sort asc exercises 0 / 10
5.4.2 STL-algorithm 2, sort desc exercises 0 / 10
5.4.3 STL-algorithm 3, find a given value exercises 0 / 10
5.4.4 STL-algorithm 4, find the last even value exercises 0 / 10
5.4.5 STL-algorithm 5, sort mod 3 exercises 0 / 10
5.4.6 STL-algorithm 6, find value from a map exercises 0 / 10
5.4.7 STL-algorithm 7, find median exercises 0 / 10
5.4.8 STL-algorithm 8, remove values exercises 0 / 10
5.5 Grading, learning, motivation
5.5.1 Grading exercises 0 / 10
5.6 Session activity
5.6.1 Activity exercises 0 / 30
5.7 Attendance and participation on the weekly exercise session
5.7.1 Weekly exercise session exercises 0 / 25

Monday, 4 November 2024, 00:00 – Sunday, 24 November 2024, 23:59

Assignment Category Submissions Points
6.1 Course topics 8 and 9
6.1.1 Trees _theory 0 / 6
6.1.2 Tree data structures and traversals _theory 0 / 4
6.1.3 Invalidation _theory 0 / 2
6.1.4 Amortized performance _theory 0 / 3
6.1.5 Verifying asymptotic performance _theory 0 / 3
6.1.6 Tips for increasing actual performance _theory 0 / 4
6.1.7 Randomization _theory 0 / 2
6.1.8 Questions about this topic's video lectures _theory 0 / 5
6.1.9 Heap _theory 0 / 12
6.1.10 Heap as an array _theory 0 / 3
6.1.11 Questions about this topic's videos _theory 0 / 6
6.2 Course topic 8 exercises
6.2.1 Trees exercises 0 / 16
6.2.2 C++ structs for a node of the tree, exercise 1 exercises 0 / 5
6.2.3 C++ structs for a node of the tree, exercise 2 exercises 0 / 5
6.2.4 Pre-order traversal exercises 0 / 7
6.2.5 In-order traversal exercises 0 / 7
6.2.6 Post-order traversal exercises 0 / 7
6.2.7 Iterator invalidation 1, ascendingVector exercises 0 / 10
6.2.8 Iterator invalidation 2, eraseEverySecond exercises 0 / 10
6.2.9 Iterator invalidation 3, duplicateEvenRemoveUneven exercises 0 / 20
6.3 Course topic 9 exercises
6.3.1 Heap insert exercises 0 / 20
6.3.2 Heap remove exercises 0 / 20
6.3.3 Heap build exercises 0 / 20
6.3.4 Heapsort exercises 0 / 20
6.4 Valgrind
6.4.1 Valgrind, the memory management analyser
6.4.2 Exercising valgrind
6.4.2.1 Exercise valgrind exercises 0 / 20
6.4.3 Valgrind tools
6.5 Project Functionality test: Basic Places
6.5.1 Functionality tests (compulsory) exercises 0 / 45
6.6 Watching lecture videos - part1
6.6.1 Watching lecture videos 'Algorithms and pseudocode' _theory 0 / 40
6.6.2 Watching lecture videos 'Measuring efficiency' _theory 0 / 40
6.6.3 Watching lecture videos 'Divide-and-conquer' _theory 0 / 39
6.6.4 Watching lecture videos 'Big-O, -Omega and -Theta' _theory 0 / 35
6.6.5 Watching lecture videos 'STL library' _theory 0 / 35
6.6.6 Watching lecture videos 'STL algorithms' _theory 0 / 35
6.7 Session activities
6.7.1 Activity exercises 0 / 30
6.8 Attendance and participation on the weekly exercise session
6.8.1 Weekly exercise session exercises 0 / 25

Monday, 2 December 2024, 00:00 – Sunday, 8 December 2024, 23:59

Assignment Category Submissions Points
9.1 Session activity
9.1.1 Activity exercises 0 / 30

Tuesday, 5 November 2024, 00:01 – Sunday, 1 December 2024, 23:59
Late submissions are allowed until Sunday, 8 December 2024, 23:59. However, points are only worth 75%.
200 points required to pass the module.

Assignment Category Submissions Points
10.1 Assignment graders
10.1.1 Functionality tests
10.1.1.1 Functionality tests (compulsory) prg1 0 / 1
10.1.2 Integration tests
10.1.2.1 Integration tests (compulsory) prg1 0 / 1
10.1.3 Compile pedantically
10.1.3.1 Compile pedantically prg1 0 / 1
10.1.4 Perftests
10.1.4.1 get_place_count prg1 0 / 1
10.1.4.2 all_places prg1 0 / 1
10.1.4.3 get_place_name prg1 0 / 1
10.1.4.4 add_place prg1 0 / 1
10.1.4.5 get_place_coord prg1 0 / 1
10.1.4.6 find_places_with_coord prg1 0 / 1
10.1.4.7 get_places_alphabetically prg1 0 / 1
10.1.4.8 get_places_distance_increasing prg1 0 / 1
10.1.4.9 all_areas prg1 0 / 1
10.1.4.10 get_area_name prg1 0 / 1
10.1.4.11 get_area_coords prg1 0 / 1
10.1.4.12 change_place_coord prg1 0 / 1
10.1.4.13 change_place_name prg1 0 / 1
10.1.4.14 ancestor_areas_of_subarea prg1 0 / 1
10.1.5 Valgrind
10.1.5.1 Valgrind prg1 0 / 1
10.1.6 Docs grader
10.1.6.1 Documentation contains complexities in an agreed format prg1 0 / 1
10.1.7 Perfestimate
10.1.7.1 Perfestimate prg1 0 / 1
10.1.8 Final project 1 grader
10.1.8.1 Final Assignment Grader prg1 0 / 580

Tuesday, 5 November 2024, 00:01 – Sunday, 8 December 2024, 23:59
Late submissions are allowed until Tuesday, 10 December 2024, 23:59. However, points are only worth 80%.

Assignment Category Submissions Points
11.1 Optional graders
11.1.1 all_subareas_of_area
11.1.1.1 all_subareas_of_area prg1-opt 0 / 100
11.1.2 get_closest_common_ancestor_of_areas
11.1.2.1 get_closest_common_ancestor_of_areas prg1-opt 0 / 100
11.1.3 remove_place
11.1.3.1 remove_place prg1-opt 0 / 100
11.1.4 get_places_closest_to
11.1.4.1 get_places_closest_to prg1-opt 0 / 100

Wednesday, 13 November 2024, 00:01 – Tuesday, 17 December 2024, 23:59
Late submissions are allowed until Wednesday, 18 December 2024, 23:59. However, points are only worth 80%.

Assignment Category Submissions Points
13.1 Project 2 graders (optional)
13.1.1 Assignment graders (optional)
13.1.1.1 route_shortest_distance
13.1.1.1.1 route_shortest_distance prg2-opt 0 / 150
13.1.1.2 route_least_crossroads
13.1.1.2.1 route_least_crossroads prg2-opt 0 / 150
13.1.1.3 route_with_cycle
13.1.1.3.1 route_with_cycle prg2-opt 0 / 150
13.1.1.4 trim_ways
13.1.1.4.1 trim_ways prg2-opt 0 / 150

_theory

0 / 900

exercises

0 / 1500

prg1

0 / 600

prg1-opt

0 / 400

prg2

0 / 400

prg2-opt

0 / 600

prp

0 / 500

x_exam

0 / 100