INTERNATIONAL COLLEGE OF BUSINESS & TECHNOLOGY LTD

ASSIGNMENT BRIEF

Assignment Cover Sheet

Qualification Module Number and Title

HND in Computing and Software Engineering Data Structures and Algorithms SED52013

Student Name & No. Assessor

Priyanga Siriwardana
Hand out date Submission Date

Assessment type Duration/Length of Weighting of Assessment

Assessment Type
Coursework 3 weeks 100%

Learner declaration

I, ………………………………………….<name of the student and registration number>,

certify that the work submitted for this assignment is my own and research sources are fully
acknowledged.

Marks Awarded
First assessor

IV marks

Agreed grade

Signature of the assessor Date

FEEDBACK FORM
 INTERNATIONAL COLLEGE OF BUSINESS & TECHNOLOGY
Module: Data Structures and Algorithms - SED52013
Student:
Assessor: Mr. Priyanga Siriwardana
Assignment:

Strong features of your work:

Areas for improvement:

Marks Awarded:

Learning outcomes covered

LO 1 Understand Data Structures and storage in computer systems.

LO 2 Develop and implement Suitable Data Structures given requirement.

LO 3 Develop, implement and use searching and sorting techniques.

Assignment Brief

Task List

Task 1 Marks 30

“POP” is a famous game among school boys. Player one will put the ball one by one and each ball will
locate on top of each other. Very first ball is located in the bottom of the tube and last ball is located in
the top.

Player 2 will fire the ball which is located in the top. Then the next ball become the top

 Identify and properly justify the most suitable data structure with their operations for above
requirement. (Explain and evaluate the advantages and disadvantages of suitable data structure.
And evaluate the suitability of sleeted algorithm with real-time examples)

Task 2 Marks 35

Crate a Program for sort the given int array. Student can select any sort algorithm for
execute the program.
30 80 05 50 40 90 70 60 100 20

1. Create an appropriate Java class.

2. Create a method to sort the given array and method require array parameter.
Create a
method to print the values in array and method require array parameter

3. Create the main method to declare the given array. Call sort and display methods.

Task 3 Marks 35

To improve the performance of the system memory management recursion algorithms,

play big role.

1. What is recursion in data structure? Identify the advantages and disadvantages of

recursion algorithms.

2. Develop method for recursion algorithm to print factorial value numbers.

Note: You can make any valid assumptions and you need to mention your valid assumptions clearly
Referencing Guidance

 To use Harvard referencing for citation and compile reference list you can go through

following guidance provided by Anglia Ruskin University.

 In the Harvard system, the author's surname and year of publication are cited in the text of your

work. The full details of the source are included in a reference list at the end of the

assignment. 

(Anglia Ruskin University,2013)

You can follow below link for more details

Guide to the Harvard Style of Referencing 2013. University Library. [pdf] Anglia Ruskin University.
Available at: <http://libweb.anglia.ac.uk/referencing/files/Harvard_referencing_2013.pdf > [Accessed 20 Octomber
2014].

Resources

Books
 An Introduction to Object-Oriented Programming with Java, 5th Edition(McGraw-
Hill)978-0-07352-330-9
 Data Structures and Algorithms in Java , 2nd Edition (Robert Lafore)

Websites

 http://www.javaworld.com/article/2073390/core-java/datastructures-and-algorithms-
part-1.html
 https://www.udemy.com/introduction-to-data-structures-algorithms-in-java/
Question 1 Out of 30
Poor
0-12
Poor explanation about suitable data structures

Basic
12-18
Basic explanation about suitable data structures

Explain with appropriate examples

Good
18-21
good explanation about suitable data structures

Explain with appropriate examples

Identify the most suitable data structures for given requirement

21-30
Excellence

good explanation about suitable data structures

Explain with appropriate examples

Identify the most suitable data structures for given requirement

Used proper justification for Identify the most suitable data structures for given
requirement

Question 2 Allocated Out of 35

Marks
 Appropriate class declaration. ex: public class SortingDemo { } 0-4
 Appropriate sort method.
o proper method name with array parameter
ex: public static void sort (int arr[]){ } 0-5
o popper sorting algorithm – method body must include appropriate
0-10
variables declarations, if conditions, loops structures, values
swaps/shifting.
 Appropriate sort method. 0-5
o Proper method name with array parameter
ex: public static void display (int arr[]){ }
0-6
o Proper display algorithm – method body must include appropriate

Page 5 of 6
 variables declarations, loop structure. 0-5
 Appropriate main method calling sort and display method.
ex: public static void main (String args[]){ }

Task 1 Out of 35
Poor 0-14

Explain the use of recursive  algorithm and poor evaluation of the

advantages of recursive  algorithm

Average 14-21

Explain the use of recursive  algorithm and basic evaluation of

the advantages of recursive  algorithm. Write a basic method
with correct parameters and proper return type

Good 21-25

Explain the use of recursive  algorithm and evaluation of the

advantages of recursive  algorithm. Write a basic method with
correct parameters and proper return type.

Write a method body with proper cording

25-35
Excellent,

Explain the use of recursive  algorithm and proper evaluation of

the advantages of recursive  algorithm. Write a basic method
with correct parameters and proper return type.

Write a proper method with appropriate comments in program

Page 6 of 6