Overview
Offerings
Rules
Contacts
Chief Examiner(s)
Notes
IMPORTANT NOTICE:
Scheduled teaching activities and/or workload information are subject to change in response to COVID-19, please check your Unit timetable and Unit Moodle site for more details.
Learning outcomes
Translate simple problem statements into algorithms, implement them in a high level programming language and test them.
Summarise and compare the properties of basic abstract data types such as stacks, queues, lists, trees, priority queues, heaps and hash tables.
Evaluate different algorithms and implementations of basic abstract data types.
Analyse algorithms by determining their best case and worst case big O time complexity.
Design efficient solutions combining basic abstract data types and applying the concepts of complexity while understanding its implications in practical situations.
Describe the classic RISC pipeline and how machine architecture can affect processor performance.
Deconstruct simple high-level code into assembly code such as MIPS R20