[SOLVED] 代写 data structure algorithm COMP10002 Assignment 1 Feedback: XXUSERNAMEXX

30 $

File Name: 代写_data_structure_algorithm_COMP10002_Assignment_1_Feedback:_XXUSERNAMEXX.zip
File Size: 725.34 KB

SKU: 6980988920 Category: Tags: , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,

Or Upload Your Assignment Here:


COMP10002 Assignment 1 Feedback: XXUSERNAMEXX

Program Presentation
Including: layout and style, readability, adherence to coding expectations, general care and appearance.
Some subset of the following lines will be retained by the marker.

•Up to Stage 1 initial allocation, +0.5.
•Up to Stage 2 initial allocation, +1.5.
•Up to Stage 3 initial allocation, +2.5.
•Up to Stage 4 initial allocation, +3.
•Up to Stage 5 initial allocation, +3.
Deductions
Some subset of the following lines will be retained by the marker. Deduct 0.5 marks for every type of errors found. Marks in each section won’t go below zero.

•#defines not in upper case;
•absence of function prototypes;
•bad choice for function names;
•bad choices for variable names;
•excessive commenting;
•inconsistent bracket placement;
•inconsistent indentation;
•insufficient commenting;
•lack of whitespace (visual appeal);
•lines >80 chars;
•no authorship statement, -0.5 for each occurrence;
•use of external code without attribution, -0.5 for each occurrence;
•use of magic numbers;
•other stylistic issue (minor);
•other stylistic issue (major), -0.5 for each occurrence;
Additions (included in total mark only if marks lost within this first section)

•comment that says “algorithms are fun”, +0.5;
•overall care and presentation, +0.5;
Other Comments from Marker

Structure and Approach
Including: decomposition in to functions, development of data structures and declaration of them at the appropriate locations, choice of parameters to functions, use of appropriate struct and typedef declarations, choice of algorithms or methods.
Some subset of the following lines will be retained by the marker.

•Up to Stage 1 initial allocation, +0.5.
•Up to Stage 2 initial allocation, +1.5.
•Up to Stage 3 initial allocation, +2.5.
•Up to Stage 4 initial allocation, +3.
•Up to Stage 5 initial allocation, +3.
Deductions 
Some subset of the following lines will be retained by the marker. Deduct 0.5 marks for every type of errors found. Marks in each section won’t go below zero.

•duplicate code segments;
•global variables;
•main function modified, -1;
•insufficient use of functions;
•functions too long or too complex;
•overly complex algorithmic approach;
•unnecessary duplication/copying of data;
•typedefs without “_t”;
•overly complex function argument lists;
•using == for equality on doubles;
•Stage 4 uses string.h library functions, -1;
•other structural issue (minor);
•other structural issue (major), -0.5 for each occurrence;
Other comments from marker:

Program Execution
Including: compilation, execution on test data, output presentation and readability.
Programs that do not compile in the test environment will lose all marks in this section. Be sure to verify your submission and check the output before you say “finished” to yourself.
Some subset of the following lines will be retained by the marker.

•Up to Stage 1 initial allocation, +2.
•Up to Stage 2 initial allocation, +5.
•Up to Stage 3 initial allocation, +7.
•Up to Stage 4 initial allocation, +9.
•Up to Stage 5 initial allocation, +9.
Deductions
Some subset of the following lines will be retained by the marker. Marks in each section won’t go below zero.

•unnecessary warning messages in compilation, -0.5;
•incorrect Stage 1 output on invis0, -0.5; (for all formatting errors in Stage 1, deduct 0.5 marks once across all test cases)
•incorrect Stage 2 output on invis0, -1 (for all formatting errors in Stage 2, deduct 0.5 marks once across all test cases);
•incorrect Stage 3 output on invis0, -0.5 (for all formatting errors in Stage 3, deduct 0.5 marks once across all test cases);
•incorrect Stage 4 output on invis0, -0.5 (for all formatting errors in Stage 4, deduct 0.5 marks once across all test cases);
•incorrect Stage 1 output on invis1, -0.5;
•incorrect Stage 2 output on invis1, -1;
•incorrect Stage 3 output on invis1, -0.5;
•incorrect Stage 4 output on invis1, -0.5;
•incorrect Stage 1 output on invis2, -0.5;
•incorrect Stage 2 output on invis2, -1;
•incorrect Stage 3 output on invis2, -1;
•incorrect Stage 4 output on invis2, -1;
•correct Stage 5 output on invis1, +0.5; the total mark should not exceed 15.
•correct Stage 5 output on invis2, +0.5; the total mark should not exceed 15.

Late Penalty
If you make a late submission without having prior agreement from the lecturer, late penalties may apply. Submissions late for more than three days won’t be accepted. Overall marks won’t go below zero.

XXMARKXX
Overall comments from marker:

Assignment Marker: XXMARKERXX 
Subject Coordinator: Jianzhong Qi, [email protected]

Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Shopping Cart
[SOLVED] 代写 data structure algorithm COMP10002 Assignment 1 Feedback: XXUSERNAMEXX
30 $