[go: up one dir, main page]
Scribd
Upload
22 views3 pages

DSA - Brief

The assignment brief outlines the requirements for the BTEC Higher National Diploma in Computing, focusing on Unit 19: Data Structures & Algorithms. Students are tasked with understanding data structures, implementing abstract data types, comparing algorithm performance, and developing a program for processing online store orders. The brief includes specific learning outcomes, submission formats, and assessment criteria for pass, merit, and distinction levels.

Uploaded by

daoduccanhh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views3 pages

DSA - Brief

The assignment brief outlines the requirements for the BTEC Higher National Diploma in Computing, focusing on Unit 19: Data Structures & Algorithms. Students are tasked with understanding data structures, implementing abstract data types, comparing algorithm performance, and developing a program for processing online store orders. The brief includes specific learning outcomes, submission formats, and assessment criteria for pass, merit, and distinction levels.

Uploaded by

daoduccanhh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Higher Nationals

Assignment Brief – BTEC (RQF)


Higher National Diploma in Computing

Unit Number and Title Unit 19: Data Structures & Algorithms

Academic Year 2024 – 2025

Unit Tutor Nguyen Ngoc Tan

Assignment Title Data Structures & Algorithms

Issue Date

Submission Date

IV Name & Date Nguyen Van Huy & 01/8/2024

Submission Format

1. Report with BTEC cover page, font 12, and Harvard style reference.

2. Source code and video demo.

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

You are interning at BKSoftware, BKSoftware is a company specializing in software solutions for businesses.

First task: You need to understand the concept of data structures, the role of data structures, and algorithms
in software development.
In this task, you should present the linked list data structure and explain the operations performed on it.
Next, explain the concept of function calls in a computer using the memory stack. Finally, provide a simple
example using a queue data structure.

Task Two: You need to understand the concept of abstract data types (ADTs) and how they help hide
information during software development.
Implement an abstract data type with object-oriented programming languages such as Java, C#, etc.

Task three: You need to study the algorithms and how their performance compares. Provides a table
comparing the execution speed of the two sorting algorithms of your choice.
Present two algorithms to find the shortest path and provide a specific example of each.

Task Four: You have been tasked with building and developing a program with the following description:

An online store needs to process orders in the order they are received. Each order contains information such
as the order number, order date, total amount, recipient name, phone number, shipping address, and status.
Each order can include multiple products, each with a product code, product name, and price. Processed orders
will be displayed on the screen and marked as "processed". Orders will be processed sequentially until the
order list is empty.

In this task, you need to specify the abstract data structure and algorithm that will be used and explain why.
Design a class diagram for the program (according to the principle of object-oriented programming).
Implement the program based on the design and perform program testing.
Pass Merit Distinction
LO1 Examine abstract data types, concrete data structures and
algorithms
P1 Create a design specification
for data structures, explaining the
M1 Illustrate, with an example, a D1 Analyse the operation, using
valid operations that can be
concrete data structure for a First illustrations, of two network
carried out on the structures. shortest path algorithms,
in First out (FIFO) queue.
providing an example of each.
P2 Determine the operations of a
M2 Compare the performance of
memory stack and how it is used
two sorting algorithms.
to implement function calls in a
computer.
LO2 Specify abstract data types and algorithms in a formal notation
D2 Discuss the view that
P3 Specify the abstract data type M3 Examine the advantages of imperative ADTs are a basis for
for a software stack using an encapsulation and information object orientation offering a
imperative definition. hiding when using an ADT. justification for the view.

LO3 Implement complex data structures and algorithms

P4 Implement a complex ADT D3 Critically evaluate the


and algorithm in an executable complexity of an implemented
M4 Demonstrate how the
programming language to solve a ADT/algorithm.
implementation of an
well-defined problem.
ADT/algorithm solves a
well-defined problem.
P5. Implement error handling
and report test results.

LO4 Assess the effectiveness of data structures and algorithms.

P6 Discuss how asymptotic


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

You might also like