COMP3001

COMP3001: Design and Analysis of Algorithms

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

View in Curtin Handbook

5.0

★★★★★Based on 1 reviews

Workload5.0/10

Avg Grade75%

Take Again100%

Had an Exam0%

1 of 1 reviewers: Heavy reading load 1 of 1 reviewers: Proctored exam

COMP3001 student reviews

Most recent review covers Semester 2, 2026

Workload, assessments, and whether students would take it again. Verified Curtin Student means the reviewer confirmed a @student.curtin.edu.au email address.

Verified Curtin Student Top ReviewerSemester 2, 2026 • Aug 2026

★★★★★

Extremely difficult unit. High content load with difficult material. Exams are 45 minutes and cover a large range of content. Test 1 is MUCH harder than the others.

Which units require COMP3001?

COMP3001 is a prerequisite for 1 unit.

COMP3002

What is COMP3001 about?

Algorithms are an essential part of any efficient solutions for computer applications that evolve with the development in computing technologies. Therefore it is imperative for any computing student to have sufficient knowledge of standard algorithm design techniques and analysis. In this unit the students will learn these standard techniques: divide and conquer, greedy, and dynamic programming. The unit shows how the techniques, among others, are used in sorting algorithms, graph algorithms, data compression, 0/1 knapsack, string searching, matrix-chain multiplication, longest common subsequence, and parallel and distributed algorithms. The students will also learn how to use the growth of functions concept to analyse algorithm resource requirement.

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 Education020109 Algorithms

Handbook View Official Handbook Page →

How this unit is taught

Lecture1 x 2 hours weekly
Tutorial1 x 2 hours weekly

Prerequisites

PrerequisitesSelect One

COMP1002Data Structures and Algorithms
COMP1000Unix and C Programming
Data Structures and Algorithms 120