Scribd
Upload
2 views

Unit 19Data Structures _ Algorithms

The document outlines an assignment for Unit 19: Data Structures & Algorithms, focusing on the design and implementation of abstract data types (ADTs) and algorithms for Softnet Development Ltd. It includes a report structure with specific parts detailing the creation of design specifications, formal reports on ADTs, and evaluations of data structures' effectiveness. The assignment emphasizes research, formal notation, and the use of the Harvard referencing system, with defined learning outcomes and assessment criteria.

Uploaded by

Amr Mohamed darwish
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Unit 19Data Structures _ Algorithms

The document outlines an assignment for Unit 19: Data Structures & Algorithms, focusing on the design and implementation of abstract data types (ADTs) and algorithms for Softnet Development Ltd. It includes a report structure with specific parts detailing the creation of design specifications, formal reports on ADTs, and evaluations of data structures' effectiveness. The assignment emphasizes research, formal notation, and the use of the Harvard referencing system, with defined learning outcomes and assessment criteria.

Uploaded by

Amr Mohamed darwish
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Unit 19: Data Structures & Algorithms

Student Name/
ID Number

Unit Number and Title 19: Data Structures & Algorithms


2022-2023
Academic Year
Dr. Mohamad Obaid
Unit Tutor

Assignment Title Softnet Development Ltd


20-1-2023
Issue Date
24-3-2023
Submission Date

IV Name & Date

Submission Format

The submission is in the form of two documents:


Part 1: A report to be presented to your colleagues. The report can include links
to performance data and a bibliography using the Harvard referencing system.
You are required to make effective use of headings, bullet points and
subsections as appropriate. Your research should be referenced using the
Harvard referencing system.
The recommended word limit is 500 words, although you will not be penalised
for exceeding the total word limit.
Part 2: A formal individual written report (saved in either a Microsoft® Word®
or PDF format). This should be written in a concise, formal business style using
single spacing and font size 12. You are required to make use of headings,
paragraphs and subsections 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 2,000–2,500 words, although you will not be
penalised for exceeding the total word limit.
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
You work as in-house software developer for Softnet Development Ltd, a
software body- shop providing network provisioning solutions. Your company is
part of a collaborative service provisioning development project and your
company has won the contract to design and develop a middleware solution
that will interface at the front-end to multiple computer provisioning
interfaces including SOAP, HTTP, JML and CLI, and the back-end telecom
provisioning network via CLI .
Your account manager has made you technical project leader and your role is to
inform them about designing and implementing abstract data types. You have
been asked to create a presentation for all collaborating partners on how ADTs
can be utilised to improve software design, development and testing. Further,
you have been asked to write an introductory report for distribution to all
partners on how to specify abstract data types and algorithms in a formal
notation.
In order to raise knowledge about the subject between the team members that
design and develop the secure application for "Softnet" company and for using
suitable data structure and algorithms and implement it using suitable programming
language.

Activity

Part 1
You will need to prepare a report on how to create a design specification for
data structures, explaining the valid operations that can be carried out on the
structures using the example of:
1. A stack ADT, a concrete data structure for a First In First out (FIFO) queue.
2. Two sorting algorithms.
3. Two network shortest path algorithms.

Part 2
You will need to provide a formal written report that includes the following:
1. Explanation on how to specify an abstract data type using the example
of software stack.
2. Explanation of the advantages of encapsulation and information hiding
when using an ADT.
3. Discussion of imperative ADTs with regard to object orientation.

Part 3
You will need to provide a formal written report that includes the following:

1- Provide a design for cryptography problem, which was illustrated in scenario using
complex ADT and algorithms.

2- Critically evaluate the complexity of these algorithms.

3- Implement this design using suitable programming language and IDE.

4- Your source code should implement error handling and displays appropriate error
messages. You should test your application and report the results.

Part 4
You will need to provide a formal written report that includes Assessing the
effectiveness of data structures and algorithms that includes the following:

1- Discuss the asymptotic analysis and how can be used.

2- Determine the two ways in which the efficiency of an algorithm can be measured.

3- Interpret what a trade-off is when specifying an ADT.

4- The implementation can used independent of data structure, you are required to
evaluate three benefits of this implementation.

Please review the subsequent grading criteria for more details on the expected elements and
topics that need to be included.
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
specification for data example, a concrete operation, using
structures explaining data structure for a illustrations, of two
the valid operations First In First out (FIFO) network shortest
that can be carried out queue. path algorithms,
on the structures. providing an example
M2 Compare the
of each.
P2 Determine the performance of two
operations of a sorting algorithms.
memory stack and how
it is used to implement
function calls in a
computer.
LO2 Specify abstract data types and algorithms in a
formal
notation
P3 Using an imperative M3 Examine the D2 Discuss the view that
advantages
definition, specify the of encapsulation and imperative ADTs are a
basis
abstract data type for a information hiding when for object orientation
and,
software stack. using an ADT. with justification,
state whether you
agree.
Pass Merit Distinction
LO3 Implement complex data structures and
algorithms
P4 Implement a M4 Demonstrate how
complex ADT and the implementation of D3 Critically evaluate
algorithm in an an ADT/algorithm solves the complexity of an
executable a well- defined problem. implemented
programming ADT/algorithm.
language to solve a
well- defined
problem.
P5 Implement error
handling and report
test results.
LO4 Assess the effectiveness of data structures
and algorithms
P6 Discuss how M5 Interpret what a D4 Evaluate three
asymptotic analysis trade- off is when benefits of using
can be used to assess specifying an ADT implementation
the effectiveness of an using an example to independent data
algorithm. support your answer. structures.
P7 Determine two
ways in which the
efficiency of an
algorithm can be
measured, illustrating
your answer with an
example.

You might also like