This document is a grade report for a student submission on implementing data structures and algorithms. The student received a grade of Merit for the assignment. The report provides feedback on the student's achievement of learning outcomes and criteria for Merit and Distinction. Overall, the assessor comments that the student explained concepts well and implemented data structures and algorithms correctly, while further analysis and elaboration could have been provided in some areas.

1. Implementing Data Structures
and Algorithms
by Ioan Tuns
FILE
TIME SUBMITTED 18-DEC-2014 10:23PM
SUBMISSION ID 38770543
WORD COUNT 2375
CHARACTER COUNT 16685
_VAR_WWW_MOODLEDATA_TEMP_TURNITINTOOLTWO_139061674
6._IOAN_TUNS-HNDCSD-DSA-19-12-2014_-_COPY.DOCX (629.22K)

24. FINAL GRADE
4/5
Implementing Data Structures and Algorithms
GRADEMARK REPORT
GENERAL COMMENTS
Instructor
Grades : 1=No submission; 2=Referral; 3=Pass;
4=Merit; 5=Distinction
Resubmissions : 1=No submission; 2=Fail;
3=Pass
Overall Feedback:
[ You have got Merit in this assignment. It is a
good report with some good presentation,
contents and structure. More critical analysis with
proper justif ications in some answers could have
been provided. Check comments on your paper
f or additional f eedback ]
Re-submission : No
Learning Outcomes
LO1: Achieved
-1.1: Achieved
-1.2: Achieved
-1.3: Achieved
LO2: Achieved
-2.1: Achieved
-2.2: Achieved
-2.3: Achieved
LO3: Achieved
-3.1: Achieved
-3.2: Achieved
Merit Descriptors
MD1: Evident
MD2: Evident
MD3: Evident
Distinction Descriptors
DD1: Not Evident
DD2: Not Evident
DD3: Not Evident
Learning outcomes (LO) On successf ul
completion of this unit a learner will:
Assessment criteria (AC) The learner can:
For a PASS
LO1 Understand data structures and

25. algorithms
AC1.1 produce design specif ication f or data
structures explaining the valid operations that
can be carried out on the structures
AC1.2 explain the operation and perf ormance of
sorting and search algorithms
AC1.3 explain the operation of recursive
algorithms and identif y situations when recursion
is used
LO2 Be able to implement data structures
and algorithms
AC2.1 Implement data structures in an executable
programming language in the context of well
def ined problems
AC2.2 Implement opportunities f or error handling
and reporting
AC2.3 Test results to enable comparison with
expected results.
LO3 Understand how strings are structured
and processed
AC3.1 explain common string operations and
their practical applications
AC3.2 demonstrate the outcome of string
operations in specif ied algorithms
Criteria for Merit -with possible evidence
M1 Identify and apply strategies to find
appropriate solutions
M1 Relevant theories and techniques/process
have been applied f or the development of the
solution. Appropriate methods have been used to
meet all requirements f or the given task.
M2 Select/Design and apply appropriate
methods / techniques
M2 A range of sources of inf ormation have been
used to investigate the algorithm used in the
assignment. Complex data has been ef f ectively
processed to provide the detailed analysis of
your algorithm.
M3 Present and communicate appropriate
findings
M3 Appropriate method have been used to build
the right algorithm to solve the problem.
Appropriate method has been used to test the
result and technical language has been used to
document the outcome.
Criteria for Distinction - with possible evidence
D1 Use critical reflection to evaluate own
work and justify valid conclusions
D1 Critical analysis has been provided f or the
result as well as the test evaluation report by

26. highlighting their weaknesses and strengths
D2 Take responsibility for managing and
organising activities
D2 Activities and proper investigations have been
used to understand and explain the algorithm
used to solve the problem
D3 Demonstrate convergent, lateral and
creative thinking
D3 Critical analysis has been provided to produce
the documentation f or the development Java
program
Solution. Appropriate analysis has been provided
f or creating technical documentation f or the
support and maintenance of a Java program
solution
PAGE 1
PAGE 2
PAGE 3
PAGE 4
PAGE 5
Comment 1
You explained the pseudo code adequately.
Comment 2
It would be better to include insertion and deletion f or double link list
PAGE 6
PAGE 7
Comment 3
It would be better to explain your pseudo code and complexity f urther.
PAGE 8
PAGE 9
PAGE 10
Comment 4
You understood data structures and algorithms. You achieved LO1.

27. PAGE 11
PAGE 12
Comment 5
Well structured source code. You provide appropriate comments.
PAGE 13
PAGE 14
Comment 6
Tests results are provided. It would be better to elaborate your error handling and reporting
f urther.
Comment 7
You were be able to implement data structures and algorithms. You achieved LO2.
PAGE 15
Comment 8
You def ined various string applications with their practical applications adequately.
PAGE 16
PAGE 17
PAGE 18
Comment 9
Well structured source code with appropriate comments.
Comment 10
You understood how strings are processed and structured. You achieved LO3.
PAGE 19
PAGE 20
PAGE 21
PAGE 22