Implementing Data Structuresand 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_1390616746._IOAN_TUNS-HNDCSD-DSA-19-12-2014_-_COPY.DOCX (629.22K)

FINAL GRADE

4/5

Implementing Data Structures and AlgorithmsGRADEMARK REPORT

GENERAL COMMENTS

InstructorGrades : 1=No submission; 2=Referral; 3=Pass;4=Merit; 5=DistinctionResubmissions : 1=No submission; 2=Fail;3=Pass

Overall Feedback:

[ You have got Merit in this assignment. It is agood report with some good presentation,contents and structure. More crit ical analysis withproper justif ications in some answers could havebeen provided. Check comments on your paperf or additional f eedback ]

Re-submission : No

Learning OutcomesLO1: 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 DescriptorsMD1: Evident MD2: EvidentMD3: Evident

Distinction DescriptorsDD1: Not EvidentDD2: Not EvidentDD3: Not Evident

Learning outcomes (LO) On successf ulcompletion of this unit a learner will:

Assessment criteria (AC) The learner can:

For a PASS

LO1 Understand data structures and

algorithms AC1.1 produce design specif ication f or datastructures explaining the valid operations thatcan be carried out on the structuresAC1.2 explain the operation and perf ormance ofsorting and search algorithms AC1.3 explain the operation of recursivealgorithms and identif y situations when recursionis used

LO2 Be able to implement data structuresand algorithms

AC2.1 Implement data structures in an executableprogramming language in the context of welldef ined problemsAC2.2 Implement opportunit ies f or error handlingand reportingAC2.3 Test results to enable comparison withexpected results.

LO3 Understand how strings are structuredand processed AC3.1 explain common string operations andtheir practical applicationsAC3.2 demonstrate the outcome of stringoperations in specif ied algorithms

Criteria for Merit -with possible evidence

M1 Identify and apply strategies to f indappropriate solutions M1 Relevant theories and techniques/processhave been applied f or the development of thesolution. Appropriate methods have been used tomeet all requirements f or the given task.M2 Select/Design and apply appropriatemethods / techniques M2 A range of sources of inf ormation have beenused to investigate the algorithm used in theassignment. Complex data has been ef f ectivelyprocessed to provide the detailed analysis ofyour algorithm.M3 Present and communicate appropriatefindings M3 Appropriate method have been used to buildthe right algorithm to solve the problem.Appropriate method has been used to test theresult and technical language has been used todocument the outcome.Criteria for Distinction - with possible evidence

D1 Use crit ical reflection to evaluate ownwork and justify valid conclusions D1 Crit ical analysis has been provided f or theresult as well as the test evaluation report by

highlighting their weaknesses and strengths

D2 Take responsibility for managing andorganising activit ies D2 Activit ies and proper investigations have beenused to understand and explain the algorithmused to solve the problem

D3 Demonstrate convergent, lateral andcreative thinking D3 Crit ical analysis has been provided to producethe documentation f or the development JavaprogramSolution. Appropriate analysis has been providedf or creating technical documentation f or thesupport and maintenance of a Java programsolution

PAGE 1

PAGE 2

PAGE 3

PAGE 4

PAGE 5

Comment 1You explained the pseudo code adequately.

Comment 2It would be better to include insertion and deletion f or double link list

PAGE 6

PAGE 7

Comment 3It would be better to explain your pseudo code and complexity f urther.

PAGE 8

PAGE 9

PAGE 10

Comment 4You understood data structures and algorithms. You achieved LO1.

PAGE 11

PAGE 12

Comment 5Well structured source code. You provide appropriate comments.

PAGE 13

PAGE 14

Comment 6Tests results are provided. It would be better to elaborate your error handling and reportingf urther.

Comment 7You were be able to implement data structures and algorithms. You achieved LO2.

PAGE 15

Comment 8You def ined various string applications with their practical applications adequately.

PAGE 16

PAGE 17

PAGE 18

Comment 9Well structured source code with appropriate comments.

Comment 10You understood how strings are processed and structured. You achieved LO3.

PAGE 19

PAGE 20

PAGE 21

PAGE 22