Overview
Offerings
S2-01-CLAYTON-ON-CAMPUS
Requisites
Prerequisite
Prohibition
Contacts
Chief Examiner(s)
Dr Alexey Ignatiev
Unit Coordinator(s)
Brendon Taylor
Learning outcomes
Translate problem statements into algorithms and implement them in a high level programming language;
Determine appropriate basic abstract data types, including; stacks, queues, lists, binary trees, priority queues, heaps and hash tables; for specific contexts;
Theoretically and experimentally evaluate different implementations of basic abstract data types;
Analyse the efficiency of algorithms by determining their best-case and worst-case big-O time complexity;
Deconstruct simple high-level code into assembly code, specifically MIPS R2000;
Work in teams to analyse algorithms and write programs.
Teaching approach
Peer assisted learning
Assessment summary
This unit has threshold mark hurdles as noted in the assessment. You must achieve at least 45% of the available marks in each group assessment, and an overall unit mark of 50% or more to be able to pass the unit. If you do not achieve the threshold mark, you will receive a fail grade (NH) and a maximum mark of 45 for the unit.