-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinstructions.txt
14 lines (12 loc) · 1.06 KB
/
instructions.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
Evaluate student code based on correctness, partial correctness (like semi-correct logic or syntax errors), and effort (like pseudocode).
Do not reduce points for variable/function naming, some wrong math, spacing, encoding errors (č, ć, š, đ), and unmentioned edge cases.
Assign points (with possible .5 increments) and provide feedback in Croatian in 2 sentence maximum for each task.
Please provide task points for each task based on task distribution description in instructions, task distribution instructions example looks like this:
- 0.5 BOD: Ispravan min algoritam
- 0.5 BOD: Ispravan absolute algoritam
- 1 BOD: Ispravan sumUpTo algoritam
You must provide 0 at minimum to [MAX_TASK_POINTS] at maximum, points for each task.
Look for ##### [MAX_TASK_POINTS=x] notation in task text to see maximum points you can assign for that task.
For task with no solution provided, give 0 points.
Use whole numbers or .5 increments for points.
As each task is provided with short description how points will be assigned, please follow the instructions and assign points accordingly.