Assignment Brief

BTEC Level 4-5 HNC/HND Diploma (QCF)

To be filled by the Student

Name of the Student :

Edexcel No : Registration No: Batch No:

Unit Assessment Information

Qualification : Higher National Diploma in Computing and Systems Development

Unit Code & Title : Unit 34 - Data Structures and Algorithms

Assessment Title & No’s : Implementation of Algorithms - (DSA – 16 – 001)

Learning outcomes and grading opportunities:

LO 01: Understand data structures and algorithms

Learning Outcomes LO1.1 LO1.2 LO1.3
LO 02: Be able to implement data structures
Learning Outcomes LO2.1 LO2.2 LO2.3
LO 03: Understand how strings are structured and processed
Learning Outcomes LO3.1 LO3.2

Merit and Distinction Descriptor

M1 M2 M3 D1 D2 D3

Date Issued : Date Due :

Date of Submission:

Assessor : Date Assessed:

Internal Verifier (IV): Date of IV:

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 1 of 11

 Statement of Originality and Student Declaration

I hereby, declare that I know what plagiarism entails, namely to use another’s work and to present it
as my own without attributing the sources in the correct way. I further understand what it means to
copy another’s work.

1. I know that plagiarism is a punishable offence because it constitutes theft.

2. I understand the plagiarism and copying policy of the Edexcel UK.
3. I know what the consequences will be if I plagiaries or copy another’s work in any of the
assignments for this program.
4. I declare therefore that all work presented by me for every aspects of my program, will be my
own, and where I have made use of another’s work, I will attribute the source in the correct
way.
5. I acknowledge that the attachment of this document signed or not, constitutes a binding
agreement between myself and Edexcel UK.
6. I understand that my assignment will not be considered as submitted if this document is not
attached to the attached.

Student’s Signature: …………………………… Date:.………………

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 2 of 11

Task 1

A palindrome is a phrase that reads the same forwards as it does backwards. For example, “DAD”,”
MOM”,” madam” are examples for palindrome.

1.1. Write a program that figures out whether the given string is a palindrome. Use suitable
String operations to avoid white spaces and punctuation (LO3.2) (D3.4)

For example:

"Never a foot too far, even." is a palindrome.

"Top step -- Sara's pet spot." is a palindrome.

1.2. Create an Example Stack class for this problem. Use Array List or an array to implement
the Stack, use suitable stack operations. (LO 2.1)
1.3. Identify and implement opportunities for error handling and reporting. (LO 2.2)
1.4. Prepare a user manual for the developed solution to assist the users to work with it.
(M 3.1)

Task 2

‘Read-With-Us’ Library Systems provides book reservation facilities to their members. The reservation
system uses a waiting list or book or other reading material allocation. According to the library rules
and regulations, when possible match between reservation and the book is found the member is
contacted via email or SMS and informed. If member is not responding within the given time period,
she or she is places back of the waiting list and must wait again.

We will simulate this process using a queue, and simplify the rules. We will ignore the realistic
constraints of the members, and simply have each member store a reference number for the book (a
random number). We will also assume that each book, once accepted, will be occupied from a
member ID.

Insert book details through the keyboard. Each book should have Reference number (a random
number ex: 2552)

The book Assignment process should remove a member from the queue if the member “accepts” the
reservation. If the member accepts then delete the member node. If the member rejects the
reservation delete the member, insert him to the back of the queue and compare next member and
repeat. This process repeats until all members find their book

2.1. Write your own implementation of the queue by using a linked list for this problem with
all the queue operations. (LO 1.1)
2.2. Test the above application with a suitable test cases (LO 2.3)

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 3 of 11

Task 3

3.1 Implement Linear/Binary search using recursive algorithm and non-recursive algorithm,
and compare the performance. (LO 1.3)
3.2. Sort the array given below with two different algorithms and compare the performance.
{12, 35, 30, 85, 69, 102, 99}
(LO 1.2)
3.3. Explain common string operations such as concatenation, substring, etc., also state their
practical applications by giving suitable examples. (LO 3.1) (M1.3)

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 4 of 11

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 5 of 11
TOB

Practical Observation Sheet

Module: Data Structures and Algorithms

Unit No: 34
Student Name: _________________________________

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 6 of 11

 Activity Activity Learning Date Signature
No Outcome
(LO)
1 Provide evidence of coding, and explain a LO 2.1
piece of coding to the audience. LO 3.2
2 Run the solution LO 2.1
LO 3.2
3 Test the solution with random data LO 2.3
4 Prove the use of Error Controlling LO 2.2
Mechanism in the solution and Error
reporting structure
5 Compare the performance of different D2
algorithms

Comments:

Assessor Name :

Date :

Signature :

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 7 of 11

 Assessment Criteria
Possible
Outcomes/Criteria for PASS Page Feedback
evidence
LO1 Understand data structures and algorithms
1.1 produce design specification for data structures Task 2.1
explaining the valid operations that can be carried
out on the structures
1.2 explain the operation and performance of Task 3.2
sorting and search algorithms
1.3 explain the operation of recursive algorithms Task 3.1
and identify situations when recursion is used

LO2 Be able to implement data structures and algorithms

2.1 implement data structures in an executable Task 1.2
programming language in the context of well-
defined problems
2.2 implement opportunities for error handling and Task 1.3
Reporting

2.3 test results to enable comparison with expected Task 2.2

results

LO3 Understand how strings are structured and processed

3.1 explain common string operations and their Task 3.3
practical applications
3.2 demonstrate the outcome of string operations Task 1.1
in specified algorithms.

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 8 of 11

Grade Descriptor for MERIT Possible evidence Feedback
M1 Identify and apply strategies to find appropriate Compare different algorithms
solutions Search about different string

M1.3 An effective approach to study and research has been operations

Applied Task 3.3

M2 Select / design appropriate methods / techniques Proper use of Harvard Referencing

Search about different string
M2.3 A range of sources of information has been used
operations

M3 Present and communicate appropriate findings Documentation is well structured

adhering to the formatting guidelines
M3.1 The appropriate structure and approach has been used
with non-overlapping facts
Data provided about the company are
accurate, reliable and consistent
related to Task 1.4

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 9 of 11

Grade Descriptor for DISTINCTION Possible evidence Feedback
D1 Use critical reflection to evaluate own work and justify Report: shown in the self-reflection
valid conclusions section, good conclusion with
suggestions for further improvement
D1.1 conclusions have been arrived at through synthesis of ideas
and have been justified

D2 Take responsibility for managing and organizing Undertaken Activities from 01 – 05 as

activities mentioned in the observation sheet
Submit the work on time
D2.3 Activities have been managed
D3 Demonstrate convergent / lateral / creative thinking
Task 1.1, Task 2.1, Task 3.1, Task 3.2
D3.4 problems have been solved.

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 10 of 11

Strengths: Weaknesses:

Future Improvements & Assessor Comment:

Assessor: Signature: Date: ____/____/______

Internal Verifier’s Comments:

Internal Verifier: Signature: Date: ____/____/______

All rights reserved ©ESOFT Metro Campus, Sri Lanka Page 11 of 11