Algorithms & Data Structures - COM00141M
Module will run
| Occurrence | Teaching period |
|---|---|
| A | Online Teaching Period 1 2023-24 |
| B | Online Teaching Period 2 2023-24 |
| C | Online Teaching Period 3 2023-24 |
| D | Online Teaching Period 4 2023-24 |
| E | Online Teaching Period 5 2023-24 |
| F |
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:
-
Express a problem solution algorithmically using pseudocode
-
Analyse the time complexity of an algorithm
-
Construct computer programs to implement algorithms
-
Test a computer program against the specification.
Indicative assessment
| Task | % of module mark |
|---|---|
| Open Examination | 100.0 |
Special assessment rules
None
Indicative reassessment
None
Module feedback
Written feedback on assessments and exam.
Indicative reading
Quentin Charatan & Aaron Kans, Java in two semesters, 4th edition, Springer, 2019.
Cormen et al. Introduction to Algorithms, 3rd edition, MIT Press, 2009.