COMP1002

COMP1002: Data Structures and Algorithms

Science and Engineering

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

View in Curtin Handbook

5.0

★★★★★Based on 1 reviews

Workload8.0/10

Avg Grade99%

Take Again100%

Had an Exam100%

Most reviews for this unit are from a previous year. Assessment style, staff, or content may have changed since.

1 of 1 reviewers: Heavy reading load 1 of 1 reviewers: Proctored exam 1 of 1 reviewers: Recorded lectures 1 of 1 reviewers: Weekly quizzes

About this Unit

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.

No tips yet. Be the first to share one.

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 →

Tuition Pattern

Lecture1 x 2 hours weekly
Tutorial1 x 2 hours weekly

Prerequisites

PrerequisitesSelect One

Student Reviews

Verified Curtin Student Semester 2, 2024 • Aug 2026

★★★★★

Well delivered unit. Good content, lectures, labs, etc. Every 1-2 weeks you submit a practical with a custom coded algorithm/data structure.