In the mobile world, devices need to meet hardware requirements for battery life and physical size. As such the efficiency of data representation and algorithm design are of critical importance. In this course, you will learn techniques for designing efficient algorithms and data storage. You will analyse time-and space-complexity of algorithms, identifying worst-case, average-case and best-case complexity. You will also use data structures including lists, stacks, queues, priority queues, search trees, hash tables, and graphs as well as algorithms for recursion, sorting and searching.
Course detail
- Prerequisite
- ICT221
- Semester of offer Subject to change
-
- Moreton Bay: Semester 2
- Units
- 12.00
- Student contribution band
- Band 2A
- Tuition fee
- 2.2A: Computing, Built Environment, Other Health
- Census date
- Academic Calendar
- Class timetable
- View class timetables for this course
Course outline
View the current course outline for this course
Students enrolled in this course should check the course Canvas site to ensure that they are accessing the most recent approved version of the course outline.