Course news
Project: Hike-and-seek
Plussa News
- prg2 split into prg2 and prg2-opt. prg2-opt moved two days later, both start- and end date
- prg1/2 test.sh modified, prg2 i-opt-tests fixed, git pull
- prg2 (and prg1 update) pullable in the course-upstream
- Video deadlines in the course calendar, videos1 deadline already 10.11!
- git repos created
- go to https://course-gitlab.tuni.fi/
- the format of the repo: compcs300-october-2024/USERNAME
- USERNAME is your username
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
Thursday, 1 August 2024, 12:00 – Wednesday, 1 January 2025, 12:00
0 / 20 2. Git
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 | 0 / 10 |
2.3 Course-upstream to pull new instructions | |||
2.3.1 Set the course-upstream | exercises | 0 / 10 | 0 / 10 |
0 / 300 3. Algorithms, pseudocode and efficiency
Monday, 21 October 2024, 00:00 – Sunday, 27 October 2024, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
3.1 Course topics 1 and 2 | |||
3.1.1 Algorithms | _theory | 0 / 2 | 0 / 4 |
3.1.2 Pseudocode | _theory | 0 / 2 | 0 / 4 |
3.1.3 From Pseudocode to code | _theory | 0 / 2 | 0 / 4 |
3.1.4 Decrease and conquer and insertion sort | _theory | 0 / 2 | 0 / 8 |
3.1.5 Questions about this week's lecture videos | _theory | 0 / 3 | 0 / 5 |
3.1.6 Algorithm efficiency | _theory | 0 / 3 | 0 / 8 |
3.1.7 Data sharing | _theory | 0 / 3 | 0 / 4 |
3.1.8 Recursion | _theory | 0 / 3 | 0 / 8 |
3.1.9 Questions about this week's lecture videos | _theory | 0 / 3 | 0 / 5 |
3.2 Course topic 2 exercises | |||
3.2.1 Pseudocode | exercises | 0 / 2 | 0 / 31 |
3.2.2 Insertion Sort | exercises | 0 / 10 | 0 / 30 |
3.2.3 Binary search | exercises | 0 / 10 | 0 / 20 |
3.3 Attendance and participation on the weekly exercise session | |||
3.3.1 Weekly exercise session | exercises | 0 / 1 | 0 / 25 |
3.4 Starting lecture attendance | |||
3.4.1 Starting lecture attendance | _theory | 0 / 10 | 0 / 144 |
0 / 365 4. Decrease- and divide-and-conquer
Monday, 21 October 2024, 00:00 – Sunday, 3 November 2024, 23:59
0 / 410 5. STL library
Monday, 28 October 2024, 00:00 – Sunday, 10 November 2024, 23:59
0 / 561 6. Trees (e.g. heaps)
Monday, 4 November 2024, 00:00 – Sunday, 24 November 2024, 23:59
0 / 222 Opens on Monday, 11 November 2024, 00:00 7. Graphs
Monday, 11 November 2024, 00:00 – Sunday, 24 November 2024, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
7.1 Course topics 10, 11 and 12 | |||
7.1.1 Graphs | _theory | 0 / 3 | 0 / 2 |
7.1.2 Breadth first search (BFS) | _theory | 0 / 3 | 0 / 4 |
7.1.3 Depth first search (DFS) | _theory | 0 / 3 | 0 / 2 |
7.1.4 Implementing graphs in C++ | _theory | 0 / 3 | 0 / 2 |
7.1.5 Weighted graphs | _theory | 0 / 2 | 0 / 4 |
7.1.6 Dijkstra | _theory | 0 / 2 | 0 / 4 |
7.1.7 A-star | _theory | 0 / 2 | 0 / 4 |
7.1.8 Questions about this week's videos | _theory | 0 / 3 | 0 / 5 |
7.2 Course topic 10 exercises | |||
7.2.1 ascendingVector | exercises | 0 / 10 | 0 / 10 |
7.2.2 minValue | exercises | 0 / 10 | 0 / 10 |
7.2.3 cumulativeSums | exercises | 0 / 10 | 0 / 10 |
7.2.4 randomizedThreePartQuicksort | exercises | 0 / 10 | 0 / 10 |
7.3 Course topic 11 exercises | |||
7.3.1 Breadth First Search | exercises | 0 / 10 | 0 / 30 |
7.3.2 Depth First Search | exercises | 0 / 10 | 0 / 30 |
7.4 Course topic 12 exercises | |||
7.4.1 Dijkstra's algorithm | exercises | 0 / 10 | 0 / 40 |
7.5 Session activities | |||
7.5.1 Activity | exercises | 0 / 1 | 0 / 30 |
7.6 Attendance and participation on the weekly exercise session | |||
7.6.1 Weekly exercise session | exercises | 0 / 1 | 0 / 25 |
0 / 175 Opens on Monday, 18 November 2024, 00:00 8. Sets and maps
Monday, 18 November 2024, 00:00 – Sunday, 1 December 2024, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
8.1 Course topic 12 | |||
8.1.1 Hashtables | _theory | 0 / 2 | 0 / 20 |
8.1.2 Questions about this week's videos | _theory | 0 / 3 | 0 / 5 |
8.1.3 Binary search trees | _theory | 0 / 2 | 0 / 6 |
8.1.4 The efficiency of binary search trees operations | _theory | 0 / 2 | 0 / 4 |
8.1.5 Questions about this week's videos | _theory | 0 / 3 | 0 / 5 |
8.2 Course topic 13 exercises | |||
8.2.1 Open hashing | exercises | 0 / 10 | 0 / 20 |
8.2.2 Hash tables | exercises | 0 / 2 | 0 / 60 |
8.3 Session activity | |||
8.3.1 Activity | exercises | 0 / 1 | 0 / 30 |
8.4 Attendance and participation on the weekly exercise session | |||
8.4.1 Weekly exercise session | exercises | 0 / 1 | 0 / 25 |
0 / 600 10. PRG1
Tuesday, 5 November 2024, 00:01 – Sunday, 1 December 2024, 23:59
Late submissions are allowed until Tuesday, 3 December 2024, 23:59.
However, points are only worth 80%.
200 points required to pass the module.
0 / 400 11. PRG1-OPT
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 / 20 | 0 / 100 |
11.1.2 get_closest_common_ancestor_of_areas | |||
11.1.2.1 get_closest_common_ancestor_of_areas | prg1-opt | 0 / 20 | 0 / 100 |
11.1.3 remove_place | |||
11.1.3.1 remove_place | prg1-opt | 0 / 20 | 0 / 100 |
11.1.4 get_places_closest_to | |||
11.1.4.1 get_places_closest_to | prg1-opt | 0 / 20 | 0 / 100 |
0 / 400 Opens on Monday, 11 November 2024, 00:01 12. PRG2
Monday, 11 November 2024, 00:01 – Sunday, 15 December 2024, 23:59
Late submissions are allowed until Tuesday, 17 December 2024, 23:59.
However, points are only worth 80%.
Assignment | Category | Submissions | Points |
---|---|---|---|
12.1 Project 2 documentation | |||
12.2 Project 2 graders (compulsory) | |||
12.2.1 Assignment graders (compulsory) | |||
12.2.1.1 Functionality tests | |||
12.2.1.1.1 Functionality tests (compulsory) | prg2 | 0 / 30 | 0 / 70 |
12.2.1.2 Integration tests | |||
12.2.1.2.1 Integration tests (compulsory) | prg2 | 0 / 30 | 0 / 70 |
12.2.1.3 Valgrind | |||
12.2.1.3.1 Valgrind | prg2 | 0 / 30 | 0 / 10 |
12.2.1.4 Docs grader | |||
12.2.1.4.1 Documentation contains complexities in an agreed format | prg2 | 0 / 30 | 0 / 10 |
12.2.1.5 Perftests | |||
12.2.1.5.1 get_way_coords | prg2 | 0 / 20 | 0 / 80 |
12.2.1.5.2 get_ways_from | prg2 | 0 / 20 | 0 / 80 |
12.2.1.5.3 route_any | prg2 | 0 / 20 | 0 / 80 |
0 / 600 Opens on Wednesday, 13 November 2024, 00:01 13. PRG2-OPT
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 / 20 | 0 / 150 |
13.1.1.2 route_least_crossroads | |||
13.1.1.2.1 route_least_crossroads | prg2-opt | 0 / 20 | 0 / 150 |
13.1.1.3 route_with_cycle | |||
13.1.1.3.1 route_with_cycle | prg2-opt | 0 / 20 | 0 / 150 |
13.1.1.4 trim_ways | |||
13.1.1.4.1 trim_ways | prg2-opt | 0 / 20 | 0 / 150 |
0 / 547 Opens on Monday, 9 December 2024, 00:00 15. Finally
Monday, 9 December 2024, 00:00 – Sunday, 15 December 2024, 23:59
Assignment | Category | Submissions | Points |
---|---|---|---|
15.1 Watching lecture videos - part2 | |||
15.1.1 Watching lecture videos 'Trees' | _theory | 0 / 1 | 0 / 35 |
15.1.2 Watching lecture videos 'Amortized complexity' | _theory | 0 / 1 | 0 / 35 |
15.1.3 Watching lecture videos 'Heaps' | _theory | 0 / 1 | 0 / 35 |
15.1.4 Watching lecture videos 'Graphs, BFS, DFS' | _theory | 0 / 1 | 0 / 35 |
15.1.5 Watching lecture videos 'Weighted graphs' | _theory | 0 / 1 | 0 / 35 |
15.1.6 Watching lecture videos 'Hashtables' | _theory | 0 / 1 | 0 / 35 |
15.1.7 Watching lecture videos 'Balanced binary trees' | _theory | 0 / 1 | 0 / 35 |
15.2 Peer feedback | |||
15.2.1 Load PRP feedback to your repo | prp | 0 / 10 | 0 / 0 |
15.3 Review the AI feedback | |||
15.3.1 Comment grader for PRG1 PRP | prp | 0 / 10 | 0 / 50 |
15.4 Peer review validator | |||
15.4.1 Peer validation based on Plussa submits | prp | 0 / 10 | 0 / 95 |
15.4.2 AI validates Peer review | prp | 0 / 1 | 0 / 1 |
15.4.3 Rate AI feedback | prp | 0 / 1 | 0 / 4 |
15.5 Exam | |||
15.5.1 Exam | x_exam | 0 / 10 | 0 / 100 |
15.6 Grading, learning, motivation, the end survey | |||
15.6.1 Grading, end-survey | exercises | 0 / 10 | 0 / 52 |
_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