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 |
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.
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.
Task | Length | % of module mark |
---|---|---|
Open Examination: Multiple choice questions online Open exam : Open book time-restricted exam |
N/A | 100 |
None
Task | Length | % of module mark |
---|---|---|
Open Examination: Multiple choice questions online Open exam : Open book time-restricted exam |
2 hours | 100 |
Written feedback on assessments and exam.
Quentin Charatan & Aaron Kans, Java in two semesters, 4th edition, Springer, 2019.
Cormen et al. Introduction to Algorithms, 3rd edition, MIT Press, 2009.