COMP5008

COMP5008: Data Structures and Algorithms

Student reviews for COMP5008 at Curtin University. See ratings, workload, grades, and honest feedback from Curtin students.

View in Curtin Handbook

COMP5008 student reviews

No reviews of COMP5008 yet. Be the first: the workload it really took, how it was assessed, and whether you would take it again.

Which units require COMP5008?

COMP5008 is a prerequisite for 1 unit.

COMP6018

What is COMP5008 about?

This unit explores the use of fundamental data structures and algorithmic techniques in computing, in order to prepare students to design efficient software applications to implement moderately-complex requirements. The unit demonstrates how various recursive and iterative algorithms work in order to solve specific problems, such as sorting and implementing operations on stacks, queues, linked lists, trees, hash tables and heaps. Students are also shown how to analyse and compare the computational complexity of these algorithms.

Quick tips

One-line things worth knowing. No full review required.

Be the first. One line on the assessments, the pace, or what to start early.

Unit details

Credits25

Contact Hours4 Weekly

Result TypeGrade/Mark

AreaSchool of Electrical Engineering, Computing and Mathematical Sciences (EECMS) (1153)

Field of Education020103 Programming

Handbook View Official Handbook Page →

How this unit is taught

Lecture1 x 2 hours weekly
Computer Laboratory1 x 2 hours weekly

Prerequisites

PrerequisitesSelect One