Unit number: unit 19-Data Structures & Algorithm
Authorized Assignment Brief 1
Student Name/
ID Number
Unit Number and Unit 19: Data Structures and Algorithms
Title
Academic Year 2024
Unit Tutor Farjila Adam
Assignment Title Optimizing Data Structures for Efficient Order Processing in an
E-commerce Fulfillment System
Issue Date 6TH February 2024
Submission Date 3rd May 2024
Submission Format
The submission is in the form of an individual written report containing the information
as defined in the tasks and an appendix with screen shots of your development and
your annotated/commented code.
Your report will contain several sections and an appendix with screenshots of your
code and IDE with annotations explaining their operation.
The report: You are required to make use of headings, paragraphs, subsections, and
illustrations as appropriate, and all work must be supported with research and
referenced using the Harvard referencing system. Please also provide a
bibliography using the Harvard referencing system. The recommended word limit is
4,000–5,500 words, although you will not be penalised for exceeding the total word
limit.
Unit Learning Outcomes
LO1. Examine 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.
Transferable skills and competencies developed
Vocational scenario
In the e-commerce industry, efficient order processing is crucial for delivering a
seamless customer experience. The existing order management system in the
organization requires improvements in data organization, retrieval, and manipulation
to optimize order processing speed and resource utilization. The goal of this project is
to identify and implement appropriate data structures, such as stacks, queues, linked
lists, and arrays, to enhance the order processing capabilities of the e-commerce
fulfillment system. By optimizing data structures, we aim to reduce processing time,
minimize memory usage, and improve overall system performance. In the e-
commerce fulfillment system, the order processing workflow involves several steps,
including order placement, inventory management, order picking, packing, and
shipping. Each step relies on efficient data management and manipulation to ensure
timely and accurate order fulfillment.
Your role in the team is of a Jr. software engineer. Now you are assigned to prepare
this document to make your organization understand the use of different data types,
different sorting and searching algorithms along with their applications and efficiency.
Assignment activity and guidance
Task 1
1. The Selection Process: Analysing various data structures, including arrays, linked
lists, stacks, queues.
2. The Optimization Process: Identifying opportunities for optimizing data storage,
retrieval, and manipulation. There is a need for a well-designed approach that
minimizes the computational complexity of data manipulation operations while
maintaining data integrity and efficiency.
3. The Storage Methods: Use FIFO (First in first out) and LIFO (Last in last out).
4. Comparative Analysis: Assessing the strengths, weaknesses, and best use cases
for each data structure.
Task 2
5. Explain Operations: Discuss a data structure to manage the order picking process,
packing, and shipping process, inventory of products, and to store order
information, customer details, and order status.
6. Describe how ATD and other components work together:
During the creation of software, discuss how different data structures work together
to support the execution of the application.
7. Identify Information hiding and encapsulation: In implementation phase what
are main information hiding and encapsulation techniques used for current
software.
Task 3
8. Implementation of Stack: You need to implement proposed Abstract data type in
any language (i.e.) C++ or Python and justify how this code can resolve the given
issue.
9. Implementation of Error Handling: Mention and implement by using code that
how error can be handled. (i.e., use error handling and test results)
10. Algorithm Analysis: Discuss the main features of asymptotic notation withanalysis
on algorithms.
Task 4
11. Algorithm Efficiency: Evaluate complete steps and structure that how algorithms
can be measured in term of time and storage complexity.
12. Algorithm Efficiency Measurement: Identify two ways that can be helpful for
measuring the efficiency of algorithm.
Advantages of Data Structures: Write detail description including benefits of using selected data
structure on any problem.
Recommended Resources
Please note that the resources listed are examples for you to use as a starting point
in your research – the list is not definitive.
Learning Outcomes and Assessment Criteria
Pass Merit Distinction
LO1: Examine abstract data types, concrete data
structures and algorithms.
P1 Create a design M1 Illustrate, with an D1 Analyse the operation, using
specification for data example, a concrete data illustrations, of two network
structures explaining the structure for a First in Frist shortest path algorithms, providing
valid operations that canbe out (FIFO) queue. an example of each.
carried out on the
structures. M2 Compare the
performance of two
P2 Determine the sorting algorithms
operations of a memory
stack and how it is usedto
implement functions calls
in a computer
LO2 Specify abstract data types and algorithm in a
formal notation. D2 Discuss the view that
imperative ADTs are a basis for
P3 Using an imperative M3 Examine the object orientation with
definition, specify the advantages of justification, state whether you
abstract data type for a encapsulation and agree.
software stack. information hiding when
using an ADT.
Pass Merit Distinction
LO3 Implement complex data structures and
algorithms.
P4 Implement a complex M4 Demonstrate how the D3 Critically evaluate the
ADT and algorithm in an implementation of an complexity of an
executable programming ADT/algorithm solves a implemented
language to solve a well- well define problem. ADT/algorithm.
defined problem.
P5 Implement error
handling and report test
results.
LO4 Assess the effectiveness of data structures and
algorithms. D4 Evaluate three
benefits of using
P6 Discuss how M5 Interpret what a trade- implementation-
asymptotic analysis canbe off is when specifying an independent data
used to assess the ADT using an example to structures.
effectiveness of an support your answer.
algorithm.
P7 Determine two ways in
which the efficiency of an
algorithm can be measured,
illustrating youranswer with
an example.
