Algorithms are the foundation of Computer Science. They enable advances in Artificial Intelligence, Machine Learning, Cybersecurity, Distributed, Mobile, and Cloud Computing, Computer Graphics and Animation, and many more. These advances have made Computer Science an indispensable part of our everyday life.The main goal of this course is to familiarize students with basic concepts in the design and analysis of algorithms and data structures. It focuses on fundamental computing problems such as sorting and searching. The students will learn how to use different algorithm design methods and data structures to solve such problems efficiently, as well as basic performance measures and analysis techniques.
Additional source review: awaiting review. Published wording is shown below.
Saved requirements encoded for automatic checks. These are prototype interpretations, not ANU decisions or degree-completion checks.
Requisite and Incompatibility
To enrol in this course you must: be studying Master of Computing or Master of Computing Advanced or have successfully completed (COMP6710 or COMP7710 or COMP1110 or COMP1140). Incompatible with COMP3600.
Referenced entries (5)
Links and code mentions retain their original context above. They may describe options, prerequisites or exclusions.
- COMP6710 · 2027
- COMP7710 · 2027
- COMP1110 · 2027 · saved source not linked
- COMP1140 · 2027 · saved source not linked
- COMP3600 · 2027 · saved source not linked
Learning Outcomes
Upon successful completion, students will have the knowledge and skills to:
Display a solid understanding of classical algorithms for fundamental computing problems such as sorting and searching and their analysis.
Demonstrate deep knowledge of various data structures, such as binary search trees and heaps, and their applications.
Design efficient algorithms using techniques such as greedy approaches and dynamic programming.
Analyse the time and space complexity of algorithms.
Published offerings
Future offerings are indicative. Only recognised 2027 sessions with a published class number are offered in the enrolment demo.
| Year | Session | Class number | Class start date | Last day to enrol | Census date | Class end date | Mode Of Delivery | Class Summary |
|---|---|---|---|---|---|---|---|---|
| 2027 | Second Semester | 10081 | 26 Jul 2027 | 02 Aug 2027 | 31 Aug 2027 | 29 Oct 2027 | In Person | N/A |
| 2028 | Second Semester | 10842 | 24 Jul 2028 | 31 Jul 2028 | 31 Aug 2028 | 27 Oct 2028 | In Person | N/A |
Complete offering text
ANU utilises MyTimetable to enable students to view the timetable for their enrolled courses, browse, then self-allocate to small teaching activities / tutorials so they can better plan their time. Find out more on the Timetable webpage. The list of offerings for future years is indicative only. Class summaries, if available, can be accessed by clicking on the View link for the relevant class number. 2027 2028 Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 10081 26 Jul 2027 02 Aug 2027 31 Aug 2027 29 Oct 2027 In Person N/A Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 10842 24 Jul 2028 31 Jul 2028 31 Aug 2028 27 Oct 2028 In Person N/A
Source evidence (1 saved copy)
Matching copies share this record. Their original file locations and checksums are retained.
assets/Courses/Computational Foundations/6000/Algorithms/Algorithms - ANU.html
Published ANU page · saved page URL
SHA-256: a2e93c532da91606d57b6692f282c2cd1f93f21e3f83fe46cca5d06b464d04a6