Assignment front sheet

Qualification Unit number and title

Pearson BTEC HND Level 5 Diploma in

Unit 34: Data Structures and Algorithms
Computing and Systems Development

Student name Assessor name

Date issued Completion date Submitted on

Assignment title Assignment : Understanding Data Structure Algorithms & Operations

In this assessment, you will have the

Learning outcome Task Evidence
LO AC opportunity to present evidence that
(LO) no. (Page no)
shows you are able to:
Understand data produce design specification for data
structures and 1.1 structures explaining the valid operations 1
algorithms that can be carried out on the structures
explain the operation and performance of
LO 1 1.2 2
sorting and search algorithms
explain the operation of recursive
1.3 algorithms and identify situations when 3
recursion is used

Learner declaration

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

Student signature: Date:

Assignment brief
Unit number and title Unit 34 Data Structures and Algorithms

Pearson BTEC HND Level 5 Diploma in Computing and Systems

Qualification
Development
Start date
Deadline/hand-in

Assessor

Assignment title Understanding Data Structure Algorithms & Operations

Purpose of this assignment

This assignment considers to improving the basic concepts and skills of Data structures and algorithms
as Trainee Software Developer. The aim of this assessment is to understand operations and algorithms
of data structure

Scenario
You have been appointed as Trainee software developer in Intellectual Software Development Company
(ISDC). A client from Hard-Core contacted and had a meeting with ISDC Program Manager. Hard-Core
is retailer of IT related equipments such as printers, scanners, USB etc. Client enquires for a desktop
program that can be supportive in record keeping, sorting, and manipulation of inventory records.
Before the designing the better solution, your team lead is assigning you to present documentation
regarding data handling structure and algorithms. So that can be helpful in achieving better suggestion
and design according to the clients need.
Here you are assigned to present documentation that simplifies data structure and algorithms,

Task 1 : (LO 1: 1.1 and M1)

Propose in brief data storing techniques such as Array, Pointer, Stack, and Set. Analyze the term LIFO,
FIFO, Link List, Queuing, tress etc. And identify the valid technique for storing records. Determine
design specification such as pseudo code, information hiding, and interface.

Task 2 (LO 1: 1.2)

State the terms push, pop and manipulating techniques such as delete, insert, update etc. Also
investigate different searching and sorting algorithms like insertion, quick, shell etc.

Task 3 (LO 1: 1.3 and D1)

Assess the operation of active, passive and recursive algorithm. Determine when recursive operation is
better to use. And also mention various algorithms such as linear, binary, binary search tree etc.
Suggest and present the better solution for the clients requirement.

Evidence Evidence
Summary of evidence required by student
checklist presented
Task 1 Document presenting basic data storing techniques

Task 2 Document that present basic data manipulating techniques

Task 3 Document that present various data structure algorithms

Sources of information:

Books and Websites:

Goodrich M, Tamassia R Data Structures and Algorithms in C++ (Wiley, 2010)
Melhorn K, Sanders P Algorithms and Data Structures: The Basic Toolbox (Springer, 2008)
http://ww3.datastructures.net
http://www.itl.nist.gov/div897/sqg/dads/
Glossary:
Sorting
Algorithms
Array
Stack
Recursive algorithms
String Manipulation
Achievement Summary

Pearson BTEC HND Level 5

Qualification Diploma in Computing and Assessor name
Systems Development
Unit 34 Data Structures and
Unit Number and Student name
Algorithms
title

Criteria To achieve the criteria the evidence must show that the Achieved ?
Reference student is able to: (tick)
LO 1
1.1 produce design specification for data structures explaining the valid
operations that can be carried out on the structures
1.2 explain the operation and performance of sorting and search
algorithms
1.3 explain the operation of recursive algorithms and identify situations
when recursion is used
Merit
M1 To achieve M1, you must demonstrate that appropriate structure
and approach that has been used while documenting operations
and performance of algorithms
Distinction
D1 To achieve D1, you must present document that reflects self-
evaluation factors regarding operations and performance of
algorithms

Higher Grade achievements (where applicable)

Grade descriptor Achieved? Grade descriptor Achieved?

(tick) (tick)

M1: Identify and apply strategies to D1: Use critical reflection to

find appropriate solutions evaluate own work and
justify valid conclusions
D2: Take responsibility for
M2: Select / design and apply managing and organising
appropriate methods / techniques activities

D3: Demonstrate
M3: Present and communicate convergent /lateral /
appropriate findings creative thinking
Assignment Feedback

Formative Feedback: Assessor to Student

Action Plan

Summative feedback

Feedback: Student to Assessor

Assessor Signature Date

Student Signature Date