Algorithms & Data Structures - COM00141M

«Back to module search

Module will run

Occurrence	Teaching period
A	Online Teaching Period 1 2022-23
B	Online Teaching Period 2 2022-23
C	Online Teaching Period 3 2022-23
D	Online Teaching Period 4 2022-23
E	Online Teaching Period 5 2022-23
F	Online Teaching Period 6 2022-23

Module aims

The aim of this module is to provide students with techniques for using some algorithms and their associated data structures. This includes the concept of computational thinking; the theoretical underpinnings of Computer Science; programming including data types, control structures, methods, inheritance, arrays, graphics and the mechanics of running and testing; algorithms, their complexity and implementation in programs; the application of these ideas in a practical context.

Module learning outcomes

Upon the completion of the module, a student should be able to:

1. Express a problem solution algorithmically using pseudocode 

2. Analyse the time complexity of an algorithm

3. Construct computer programs to implement algorithms

4. Test a computer program against the specification.

Indicative assessment

Task	% of module mark
Open Examination	100

Special assessment rules

None

Indicative reassessment

Task	% of module mark
Open Examination	100

Module feedback

Written feedback on assessments and exam.

Indicative reading

Quentin Charatan & Aaron Kans, Java in two semesters, 4^th edition, Springer, 2019.

Cormen et al. Introduction to Algorithms, 3^rd edition, MIT Press, 2009.