Higher Nationals

Internal verification of assessment decisions – BTEC (RQF)

INTERNAL VERIFICATION – ASSESSMENT DECISIONS
Programme title

Assessor Internal
Verifier
Unit 19: Data Structures and Algorithms
Unit(s)

Assignment title

Student’s name
List which assessment Pass Merit Distinction
criteria the Assessor has
awarded.
INTERNAL VERIFIER CHECKLIST

Do the assessment criteria awarded match

those shown in the assignment brief? Y/N

Is the Pass/Merit/Distinction grade awarded

justified by the assessor’s comments on the Y/N
student work?
Has the work been assessed Y/N
accurately?
Is the feedback to the student:
Give details:
• Constructive? Y/N
• Linked to relevant assessment criteria? Y/N
• Identifying opportunities for improved Y/N
performance?
Y/N
• Agreeing actions?
Does the assessment decision need Y/N
amending?

Assessor signature Date

Internal Verifier signature Date

Programme Leader signature (if required)
Date
Confirm action completed
Remedial action taken
Give details:

Assessor signature Date

Internal Verifier
signature Date
Programme Leader
signature (if required) Date
Higher Nationals - Summative Assignment Feedback Form
Student Name/ID
Unit 19: Data Structures and Algorithms
Unit Title
Assignment Number 1 Assessor
Date Received 1st
Submission Date submission
Date Received 2nd
Re-submission Date submission
Assessor Feedback:
LO1 Demonstrate a range of interpersonal and transferable communication skills to a target audience
Pass, Merit & Distinction P1 P2 M1 M2 D1
Descripts

LO2 Apply critical reasoning and thinking to a range of problem-solving scenarios

Pass, Merit & Distinction P3 M3 D2
Descripts

LO3 Discuss the importance and dynamics of working within a team and the impact of team working in
different environments
Pass, Merit & Distinction P4 P5 M4 D3
Descripts

LO4 Examine the need for Continuing Professional Development (CPD) and its role within the workplace
and for higher level learning
Pass, Merit & Distinction P6 P7 M5 D4
Descripts

Grade: Assessor Signature: Date:

Resubmission Feedback:

Grade: Assessor Signature: Date:

Internal Verifier’s Comments:

Signature & Date:

* Please note that grade decisions are provisional. They are only confirmed once internal and external moderation has taken place and
grades decisions have been agreed at the assessment board.

Assignment Feedback
Formative Feedback: Assessor to Student

Action Plan

Summative feedback

Feedback: Student to Assessor

Assessor Date
signature

Student Date
signature
Pearson Higher Nationals in
Computing
Unit 19: Data Strctures & Algorithms
Assignment 01
General Guidelines

1. A cover page or title page should be attached to your assignment. Use page 1 of this assignment
brief as your cover page and make sure all details are accurately filled.
2. The entire assignment brief should be attached as the first section of your assignment.
3. The assignment should be prepared using a word processing software.
4. The assignment should be word processing in an A4 sized paper.
5. Allow 1” margin on top, bottom and right sides of the paper and 1.25” on the left side (for
binding).

Word Processing Rules

1. The font size should be 12 point, and should be in the style of Time New Roman.
2. Set line spacing to 1.5. Justify all paragraphs.
3. Ensure that all headings are consistent in terms of size and font style.
4. Use footer function on the word processor to insert your name, unit, assignment no, and page
number on each page. This is useful if individual sheets get detached from the submission.
5. Use the spell check and grammar check function of the word processing application to review
the use of language on your assignment.
Important Points:

1. Carefully check carefully the hand in date and the instructions given with the assignment. Late
submissions will not be accepted.
2. Ensure that sufficient time is spent to complete the assignment by the due date.
3. Do not wait till the last minute to get feedback on the assignment. Such excuses will not be
accepted for late submissions.
4. You must be responsible for efficient management of your time.
5. If you are unable to hand in your assignment on time and have valid reasons such as illness, you
may apply (in writing) for an extension.
6. Failure to achieve at least a PASS grade will result in a REFERRAL grade.
7. Non-submission of work without valid reasons will lead to an automatic REFERRAL. You will
then be asked to complete an alternative assignment.
8. If you use other people’s work or ideas in your assignment, it must be properly referenced, using
the HARVARD referencing system, in your text or any bibliography. Otherwise, you’ll be found
guilty of committing plagiarism.
9. If you are caught plagiarising, your grade will be reduced to a REFERRAL or at worst, you could
be excluded from the course.
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 form. 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 Edexcel UK.
3. I know what the consequences will be if I plagiarise 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 aspect 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 assignment.

Student’s Signature: Date:

(Provide E-mail ID) (Provide Submission Date)
Higher National Diploma in Business
Assignment Brief
Student Name /ID Number
Unit Number and Title Unit 19 : Data Structures and Algorithms
Academic Year 2018/19
Unit Tutor
Assignment Title Specification, Implemenation, and Assessment of Data Strctures for a
sample scenario.
Issue Date
Submission Date
IV Name & Date

Submission format

The submission should be in the form of a report, which contains code snippets (which must be
described well), text based descriptions, and digrams where appropriate. References to external
sources of knowledge must be cited (reference list supported by in-text citations) using the
Harvard Referencing style.

Unit Learning Outcomes:

LO1. Examine abstract data types, concrete data structures and algorithms.
LO2. Specify abstract data types and algorithms in a formal notation.
LO3. Implement complex data structures and algorithms.
LO4. Assess the effectiveness of data structures and algorithms.
Assignment Brief and Guidance:

Scenario
‘XYZ’ hotel chain has 100 banquet halls island wide. Any hotel has minimum one banquet hall to
maximum 5 halls. It provides online hotel banquet hall reservation facilities to their customers.
The reservation system uses a waiting list of the selected banquet halls.

Each banquet hall has unique id, name, location, maximum number guests, reservation date
and the three menu prices. Customer can search a banquet hall with the location, reservation
date and the number of guests. According to the hotel chain rules and regulations, when a
possible match between reservation and the banquet hall is found the customer is contacted
via email or SMS and informed. If customer is not responding within a day, he or she is placed
back in the waiting list and must wait again for another hall.

If customer requested a date change or a location change or a change in number of guests, he

or she is placed back in the waiting list and must wait again for another reservation.
We will assume that each banquet hall, once accepted, will be occupied by a reservation ID.
Insert banquet hall details, reservation details and customer details through the keyboard.
The reservation process should remove a banquet hall on a given date from the queue if the
customer “accepts” the reservation. If the customer rejects or changes the reservation delete
the customer reservation, insert it to the back of the queue and compare next customer
reservation and repeat. This process repeats until all customers complete their reservations.
Task 1: Which data structure can be used, when simulating the above scenario. What are the
valid operations that can be carried out on this data structure?

Task 2: Implement the above scenario using the selected data structure and its valid operations
for the design specification given in task 1. Use suitable error handling where appropriate. Test
the application using suitable test cases and illustrate the system. Provide evidence of the test
cases and the test results.

Task 3: Determine the operations of a memory stack and how it is used to implement function
calls related to the above scenario.

Task 4: Sort the banquet hall list and display from the smallest to largest based on the
maximum number of seating arrangements that can be done.
Sort the banquets halls with two different sorting algorithms and compare the performances of
those two algorithms.

Task 5: There are 8 hotels available in the Southern district in Sri Lanka. A customer plans to
visit all of these eight hotels through the shortest path within a day.
Analyse the operation, using illustrations, of two shortest path algorithms, showing how it
operates using a sample graph.

Task 6: Banquet hall details are stored from oldest to newest hall. The customer should be able
to find from the newest to the oldest banquet hall added to the hotel chain.
Using an imperative definition, specify the abstract data type for the above scenario.
Examine the advantages of encapsulation and information hiding when using an ADT selected
for the above scenario.
Object orientation is a paradigm where a computer program functions by objects calling the
methods of other objects, which ultimately produces program behaviour. It makes
 programming simple, readable, and makes programs maintainable. Imperative ADTs are basis
for object orientation. Do you agree? Justify your answer.

Task 7: Implement the above scenario using the selected complex ADT.
Demonstrate how the implementation of an ADT/algorithm solves the above problem.
Critically evaluate the complexity of an implemented ADT/algorithm.
Determine the different ways in which the efficiency of an algorithm can be measured,
illustrating your answer the algorithm which you have developed.

Task 8: Asymptotic analysis can be used to assess the effectiveness of an algorithm. How to use
the Asymptotic analysis for the scenario given in task 7?
What sort of trade-offs exists when you use a ADT for implementing programs? Describe the
benefits of using independent data structures for implementing programs.

Acknowledgment
 In performing my assignment, I had to take the help and guideline of my respected persons,
who deserve my greatest gratitude. The completion of this assignment gives to me much
pleasure. I would like to show my gratitude to our lecturer MR. Lilanka

I like to express my gratitude towards my parents & my friends for giving me their kind co-
operation and encouragement, which help me in completion of this project.

I would also like to extend my sincere thanks to all those who have guided me directly and
indirectly in writing this assignment.

Thank you.
Grading Rubric

Grading Criteria Achieved Feedback

LO1. Examine abstract data types, concrete data structures

and algorithms.

P1 Create a design specification for data structures explaining

the valid operations that can be carried out on the structures.

P2 Determine the operations of a memory stack and how it is

used to implement function calls in a computer.

M1 Illustrate, with an example, a concrete data structure for

a First In First out (FIFO) queue.

M2 Compare the performance of two sorting

algorithms.
D1 Analyse the operation, using illustrations, of two network
shortest path algorithms, providing an example of each.

LO2. Specify abstract data types and algorithms in a

formal notation.
P3 Using an imperative definition, specify the abstract data
type for a software stack.

M3 Examine the advantages of encapsulation and

information hiding when using an ADT.
D2 Discuss the view that imperative ADTs are a basis for
object orientation and, with justification, state whether you
agree.

LO3. Implement complex data structures and algorithms.

P4 Implement a complex ADT and algorithm in an executable

programming language to solve a well-defined problem.

P5 Implement error handling and report test results.

M4 Demonstrate how the implementation of an
ADT/algorithm solves a well-defined problem.
D3 Critically evaluate the complexity of an implemented
ADT/algorithm.

LO4. Assess the effectiveness of data structures and

algorithms.
P6 Discuss how asymptotic analysis can be used to assess
the effectiveness of an algorithm.
P7 Determine two ways in which the efficiency of an
algorithm can be measured, illustrating your answer with
an example.
M5 Interpret what a trade-off is when specifying an ADT
using an example to support your answer.
D4 Evaluate three benefits of using implementation
independent data structures.