Higher Nationals
Internal verification of assessment decisions – BTEC (RQF)
INTERNAL VERIFICATION – ASSESSMENT DECISIONS
Programme title
Higher National Diploma in Computing
Assessor
Unit(s)
Assignment title
Internal Verifier
Unit 19 – Data Structures and Algorithms
Specification, Implementation, and Assessment of Data Structures for a sample
scenario.
Student’s name
List which assessment criteria
the Assessor has awarded.
Pass
Merit
Distinction
INTERNAL VERIFIER CHECKLIST
Do the assessment criteria awarded match
those shown in the assignment brief?
Is the Pass/Merit/Distinction grade awarded
justified by the assessor’s comments on the
student work?
Has the work been assessed
accurately?
Is the feedback to the student:
Give details:
• Constructive?
• Linked to relevant assessment criteria?
• Identifying opportunities for
improved performance?
• Agreeing actions?
Does the assessment decision need
amending?
Y/N
Y/N
Y/N
Y/N
Y/N
Y/N
Y/N
Y/N
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 Title
Unit 19:
Assignment Number
1
Data Structures and Algorithms
Assessor
Submission Date
Date Received 1st
submission
Re-submission Date
Date Received 2nd
submission
Assessor Feedback:
LO1 Examine different concrete data structures and it’s valid operations.
Pass, Merit &
P1
P2
M1
M2
Distinction Descripts
D1
LO2 Discuss the advantages, complexity of Abstract Data Type and importance concepts of
Object orientation.
Pass, Merit &
Distinction Descripts
P3
M3
D2
LO3 Implement, Demonstrate and evaluate complex ADT algorithm.
Pass, Merit &
Distinction Descripts
P4
P5
M4
D3
LO4 Examine the advantages of Independent data structures and discuss the need of
asymptotic analysis to assess the effectiveness of an algorithm.
Pass, Merit &
P6
P7
D4
M5
Distinction 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 signature
Date
Student signature
Date
Pearson Higher Nationals in
Computing
Unit 19: Data Structures & Algorithms
Assignment 01
General Guidelines
•
A Cover page or title page – You should always attach a title page to your assignment. Use previous
page as your cover sheet and make sure all the details are accurately filled.
•
Attach this brief as the first section of your assignment.
•
All the assignments should be prepared using a word processing software.
•
All the assignments should be printed on A4 sized papers. Use single side printing.
•
Allow 1” for top, bottom , right margins and 1.25” for the left margin of each page.
Word Processing Rules
•
The font size should be 12 point, and should be in the style of Time New Roman.
•
Use 1.5 line spacing. Left justify all paragraphs.
•
Ensure that all the headings are consistent in terms of the font size and font style.
•
Use footer function in the word processor to insert Your Name, Subject, Assignment No, and
Page Number on each page. This is useful if individual sheets become detached for any reason.
•
Use word processing application spell check and grammar check function to help editing your
assignment.
Important Points:
•
It is strictly prohibited to use textboxes to add texts in the assignments, except for the compulsory
information. eg: Figures, tables of comparison etc. Adding text boxes in the body except for the
before mentioned compulsory information will result in rejection of your work.
•
Carefully check the hand in date and the instructions given in the assignment. Late submissions
will not be accepted.
•
Ensure that you give yourself enough time to complete the assignment by the due date.
• Excuses of any nature will not be accepted for
failure to hand in the work on time.
•
You must take responsibility for managing your own time effectively.
•
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.
•
Failure to achieve at least PASS criteria will result in a REFERRAL grade .
•
Non-submission of work without valid reasons will lead to an automatic RE FERRAL. You will then
be asked to complete an alternative assignment.
•
If you use other people’s work or ideas in your assignment, reference them properly using
HARVARD referencing system to avoid plagiarism. You have to provide both in-text citation and
a reference list.
•
If you are proven to be guilty of plagiarism or any academic misconduct, your grade could be
reduced to A REFERRAL or at worst you could be expelled 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.
•
I know that plagiarism is a punishable offence because it constitutes theft.
•
I understand the plagiarism and copying policy of Edexcel UK.
•
I know what the consequences will be if I plagiarise or copy another’s work in any of the
assignments for this program.
•
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.
•
I acknowledge that the attachment of this document signed or not, constitutes a binding
agreement between myself and Pearson, UK.
•
I understand that my assignment will not be considered as submitted if this document is not
attached to the assignment.
Student’s Signature:
(Provide E-mail ID)
Date:
(Provide Submission Date)
Higher National Diploma in Business
Assignment Brief
Student Name /ID Number
Unit Number and Title
Academic Year
Unit Tutor
Assignment Title
Unit 19 :
Data Structures and Algorithms
2021/22
Specification, Implementation, and Assessment of Data Structures 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 diagrams 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
ABC Pvt Ltd organizing Car Racing event across western province and they decided to have
maximum of 6 cars(participants) to compete.
There are totally 3 Rounds and at the end of each round lowest rank car will be eliminated
from the Race.
Each car has unique number, brand, sponsor and driver details.
In order to manage this particular event ABC Pvt Ltd decided to develop an Application.
Application functions are listed down.
1.Register Car Details
2.Delete a car
3.Insert 3 Rounds Results.
4.Find out the winners (1st,2nd,3rd)
5.Search for a particular car
Task 1: Examine and create data structure by simulating the above scenario and explain the
valid operations that can be carried out on this data structure.
Determine the operations of a queue and critically review how it is used to implement
function calls related to the above scenario.
Task 2: Implement the above scenario using the selected data structure and its valid
operations for the design specification given in task 1 by using java programming. Use
suitable error handling and Test the application using suitable test cases and illustrate the
system. Provide evidence of the test cases and the test results.
Task 3 : Registered Car details are stored from oldest to newest. Management of ABC Pvt Ltd
should be able to find from the newest to oldest registered car details. Using an imperative
definition, specify the abstract data type for the above scenario and implement specified ADT
using java programming and briefly discuss the complexity of chosen ADT algorithm. List
down the advantages of Encapsulation and Information hiding when using an ADT selected
for the above scenario.
“Imperative ADTs are basis for object orientation.” Discuss the above view stating whether
you agree or not. Justify your answer.
Task 4: ABC Pvt Ltd plans to visit all of these participants through the shortest path within a
day.
Analyse the above operation by using illustrations, of two shortest path algorithms, specify
how it operates using a sample graph diagram. Sort the cars based on numbers with two
different sorting algorithms and critically review the performances of those two algorithms
by comparing them.
Task 5: Evaluate how Asymptotic analysis can be used to assess the effectiveness of an
algorithm and critically evaluate the different ways in which the efficiency of an algorithm
can be measured.
Critically review the sort of trade-offs exists when you use an ADT for implementing
programs. You also need to evaluate the benefits of using independent data structures for
implementing programs.
Grading Rubric
Grading Criteria
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.
Achieved
Feedback
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.