Scribd
Upload
244 views

Assignment Guide

Assignment Guide

Uploaded by

S un
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
244 views

Assignment Guide

Assignment Guide

Uploaded by

S un
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT 16: Cloud Computing

Unit 19: Data Structures &


Algorithms
Unit code D/615/1649
Unit level 5
Credit value 15

Introduction
The knowledge to implement algorithms and data structures that solve real problems, and
knowing the purpose, complexity and use of algorithms is part of an essential toolkit for software
engineers. An algorithm is a sequence of instructions used to manipulate data held in a
structured form and together constitute design patterns for solving a diverse range of computer
problems, including network analysis, cryptography, data compression and process control.

This unit introduces students to data structures and how they are used in algorithms, enabling
them to design and implement data structures. The unit introduces the specification of abstract
data types and explores their use in concrete data structures. Based on this knowledge, students
should be able to develop solutions by specifying, designing and implementing data structures
and algorithms in a variety of programming paradigms for an identified need.

Among the topics included in this unit are abstract data types specification, formal data
notations, data encapsulation, complex data structures, programming language implementations
using handles, pointers, classes and methods, algorithm types, data structure libraries, algorithm
complexity, asymptotic testing and benchmarking.

On completion of this unit the student should be able to identify program data requirements,
specify abstract data types using a formal notation, translate into concrete data structures and
be able to develop, using a programming paradigm, different sorting, searching and navigational
algorithms that implement complex data structures and evaluate their effectiveness.

As a result of studying this unit students will develop skills such as communication literacy,
critical thinking, analysis, synthesis, reasoning and interpretation, which are crucial for gaining
employment and developing academic competence.

Learning Outcomes

By the end of this unit students will be able to:

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


UNIT 16: Cloud Computing

Unit Content:
Wu, C. Thomas, An Adam Drozdek, Data Granville Barnett, and
introduction to object- Structures and Luca Del Tongo, Data
oriented programming Algorithms in Java, Structures and
with java™, fifth Second Edition Algorithms:
edition Annotated Reference
with Examples, 1st
edition
LO1. Examine abstract
data types, concrete X X X
data structures and
algorithms
P1 Create a design
specification for Chapter 0, 1
data
structures
explaining the
valid operations
that can
be carried out on
the
structures.
P2 Determine the
Chapter 4
operations of a
memory
stack and how it is
used
to implement
function
calls in a computer

M1 Illustrate, with Chapter 6


an
example, a
concrete
data structure for a
First
In First out (FIFO)
queue.
M2 Compare the Chapter 9 Chapter 8
performance of two
sorting algorithms.
D1 Analyse the
operation, Chapter 8
using illustrations,
of two
network shortest
path
algorithms,
providing an
example of each
LO2 Specify X
abstract data types
and algorithms in a
formal notation
UNIT 16: Cloud Computing

P3 Using an Chapter 1
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 x X X
complex data
structures and
algorithms

P4 Implement a Chapter 2-7


complex ADT and
algorithm in an
executable
programming
language to solve a
well
defined problem.
P5 Implement
Chapter 8
error
handling and report
test
results.
M4 Demonstrate Chapter 1-8 Chapter 2-7
how
the implementation
of an
ADT/algorithm
solves a
well-defined
problem.
D3 Critically Chapter 1-8 Chapter 2-7
evaluate the
complexity of an
implemented
UNIT 16: Cloud Computing

ADT/algorithm
LO4 Assess the X X
effectiveness of
data structures and
algorithms
P6 Discuss how Chapter 1 Chapter 1
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.

You might also like