COMP20003 Algorithms and Data Structures
University of Melbourne · Level 2 · 12.5 points · Runs in 2026: Semester 2.
- Final exam 45%
- About 4 class hours a week
- 10% group work
Is COMP20003 hard?
COMP20003: Harder. Makes it harder: Reviewers say it takes a lot of time.
What you learn
Common data structures and algorithms, why they work, how fast they are and when to use each.
After it you can
- Argue whether an algorithm is correct
- Pick the right data structure for a problem
- Implement sorting, search and graph algorithms
What you need first
((COMP10002 or COMP20005) and 25 points of MAST) or “VCE Algorithmics students may take the maths requirement concurrently (Enrolment Assistance form)”
What it leads to
- COMP30013 Advanced Studies in Computing
- COMP30019 Graphics and Interaction
- COMP30020 Declarative Programming
- COMP30023 Computer Systems
- COMP30024 Artificial Intelligence
- COMP30026 Models of Computation
- COMP90049 Introduction to Machine Learning
- SWEN30006 Software Modelling and Design
Can’t be taken together with
Careers
Helps toward: Software Engineer, Web and social media developer, Computing professional, Mobile app designer
How it’s assessed
Assignments 40%, Participation 5%, Tests 10%, Final exam 45%
Student reviews and ratings
Summarised from 9 students on StudentVIP (2017–2025)
- Generally well liked: practical algorithms with real applications, often compared favourably with COMP20007 for people who prefer applications over theory.
- The assignments are the main workload: written in C with heavy use of pointers, often from scratch. Start early; do not leave them to the last minute.
- Reviewers say the theory and maths are not especially heavy; a solid intuition for how each algorithm works is usually enough.
A summary of public reviews, not scored here.
Taken this subject? Rate it anonymously (difficulty, workload, marking, would you recommend it) and leave a tip for next year's students. Rate COMP20003
Quick answers
- When is COMP20003 offered?
- Runs in 2026: Semester 2.
- What do I need before taking COMP20003?
- Needs ((COMP10002 or COMP20005) and 25 points of MAST) or “VCE Algorithmics students may take the maths requirement concurrently (Enrolment Assistance form)”.
- Does COMP20003 have a final exam?
- Yes, the final exam is 45% of the mark. Assessment: Assignments 40%, Participation 5%, Tests 10%, Final exam 45%.
- Is COMP20003 hard?
- From 9 student reviews on StudentVIP: Generally well liked: practical algorithms with real applications, often compared favourably with COMP20007 for people who prefer applications over theory.
- What do students say about COMP20003?
- Generally well liked: practical algorithms with real applications, often compared favourably with COMP20007 for people who prefer applications over theory. The assignments are the main workload: written in C with heavy use of pointers, often from scratch. Start early; do not leave them to the last minute. Reviewers say the theory and maths are not especially heavy; a solid intuition for how each algorithm works is usually enough.
- How many class hours a week does COMP20003 have?
- 4 h a week in class
- Can I take COMP20003 as breadth?
- Yes, for: Bachelor of Arts, Bachelor of Commerce, Bachelor of Design, Bachelor of Fine Arts (Acting), Bachelor of Fine Arts (Animation), Bachelor of Fine Arts (Dance), Bachelor of Fine Arts (Film and Television), Bachelor of Fine Arts (Music Theatre), Bachelor of Fine Arts (Production), Bachelor of Fine Arts (Screenwriting), Bachelor of Fine Arts (Theatre), Bachelor of Fine Arts (Visual Art), Bachelor of Music.
- What can I take after COMP20003?
- 8 subjects need it first, for example COMP30013, COMP30019, COMP30020, COMP30023.
- Can I rate COMP20003?
- Yes. If you've taken it, rate it anonymously on this page (difficulty, workload, marking, would you recommend it) and leave a tip for next year's students. Averages show once 3 students have rated it; tips are checked before they appear.
Source: University of Melbourne Handbook 2026
Always confirm in the official Handbook.
PickMySubjects is a free, unofficial planner made by a UniMelb graduate.