Algorithms & Data Structures - COM00141M
Module will run
| Occurrence | Teaching period |
|---|---|
| A | Online Teaching Period 1 2024-25 |
| B | Online Teaching Period 2 2024-25 |
| C | Online Teaching Period 3 2024-25 |
| D | Online Teaching Period 4 2024-25 |
| E | Online Teaching Period 5 2024-25 |
| F | Online Teaching Period 6 2024-25 |
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
Additional assessment information
Please refer to the module Canvas page for full details of
module assessment.
Indicative reassessment
None
Module feedback
Written feedback on assessments and exam.
Indicative reading
Data structures and algorithms in Python
Goodrich, Michael T.,
Tamassia, Roberto, Goldwasser, Michael H.,, Hoboken, NJ , Wiley, [2013],