This course covers a large spectrum of algorithmic topics such as approximation algorithms, randomized algorithms, parallel/distributed algorithms, and online algorithms. Students will learn how to analyze the most fundamental algorithms in these areas using various techniques from graph theory, probability theory, and algebra. After successful completion of the course, students will be able to design efficient and effective algorithms for similar problems leveraging these techniques. Furthermore, students will learn about the most recent research advancements in these areas by studying current research publications.

Learning Outcomes

Upon successful completion, students will have the knowledge and skills to:

1. Display a deep understanding of classical approximation and graph algorithms and their analysis.
2. Analyze the efficiency and correctness of randomized algorithms and data structures.
3. Demonstrate a good knowledge of parallel, distributed, and online algorithms.
4. Design and analyze efficient algorithms using various advanced algorithmic techniques such as linear programming, graph theory, probability theory, and algebra.
5. Understand, analyze, summarize, and present research publications in the area of algorithm design.

Research-Led Teaching

The course has assessment tasks (A2.1, A2.2) for which the students can explore research papers relevant to the course.

Recommended Resources

Whether you are on campus or studying online, there are a variety of online platforms you will use to participate in your study program. These could include videos for lectures and other instruction, two-way video conferencing for interactive learning, email and other messaging tools for communication, interactive web apps for formative and collaborative activities, print and/or photo/scan for handwritten work and drawings, and home-based assessment.

ANU outlines recommended student system requirements to ensure you are able to participate fully in your learning. Other information is also available about the various Learning Platforms you may use.

Staff Feedback

Students will be given feedback in the following forms in this course:

• written comments
• verbal comments
• feedback to whole class, groups, individuals, focus group etc

Student Feedback

ANU is committed to the demonstration of educational excellence and regularly seeks feedback from students. Students are encouraged to offer feedback directly to their Course Convener or through their College and Course representatives (if applicable). Feedback can also be provided to Course Conveners and teachers via the Student Experience of Learning & Teaching (SELT) feedback program. SELT surveys are confidential and also provide the Colleges and ANU Executive with opportunities to recognise excellent teaching, and opportunities for improvement.

Other Information

The use of Generative AI Tools (e.g., ChatGPT) is permitted in this course, given that proper citation and prompts are provided, along with a description of how the tool contributed to the assignment. Guidelines regarding appropriate citation and use can be found on the ANU library website (https://libguides.anu.edu.au/generative-ai). Marks will reflect the contribution of the student rather than the contribution of the tools. Further guidance on appropriate use should be directed to the convener for this course.

Class Schedule

Week/Session	Summary of Activities	Assessment
1	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	Make sure you sign up for a lab at https://mytimetable.anu.edu.au/even/student before Week 1.
2	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
3	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
4	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
5	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
6	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
7	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
8	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
9	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
10	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
11	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.
12	Lectures will cover advanced topics in algorithms spanning problem formulation, design, and analysis of approximation algorithms, randomised algorithms, online algorithms, integer linear programming, architecture efficiencies, alongside some exposure to state-of-the-art developments, considerations, and applications.	These are indicative and exact content is subject to modifications. Please monitor Canvas and course communication channels for updates.

Tutorial Registration

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.

Assessment Summary

Assessment task	Value	Due Date	Learning Outcomes
Quizzes (Redeemable against A1)	10 %	*	1,2,3,4
Assignment 1 (Redeemable against Quizzes)	10 %	25/03/2026	1,2,3,4
Assignment 2 Part 1	20 %	22/04/2026	1,2,3,4,5
Assignment 2 Part 2	30 %	20/05/2026	1,2,3,4,5
Final Exam	40 %	*	1,2,3,4

* If the Due Date and Return of Assessment date are blank, see the Assessment Tab for specific Assessment Task details

Policies

ANU has educational policies, procedures and guidelines , which are designed to ensure that staff and students are aware of the University’s academic standards, and implement them. Students are expected to have read the Academic Integrity Rule before the commencement of their course. Other key policies and guidelines include:

• Academic Integrity Policy and Procedure
• Student Assessment (Coursework) Policy and Procedure
• Extenuating Circumstances Application
• Student Surveys and Evaluations
• Deferred Examinations
• Student Complaint Resolution Policy and Procedure
• Code of practice for teaching and learning

Assessment Requirements

The ANU is using Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. For additional information regarding Turnitin please visit the Academic Skills website. In rare cases where online submission using Turnitin software is not technically possible; or where not using Turnitin software has been justified by the Course Convener and approved by the Associate Dean (Education) on the basis of the teaching model being employed; students shall submit assessment online via ‘Canvas’ outside of Turnitin, or failing that in hard copy, or through a combination of submission methods as approved by the Associate Dean (Education). The submission method is detailed below.

Moderation of Assessment

Marks that are allocated during Semester are to be considered provisional until formalised by the College examiners meeting at the end of each Semester. If appropriate, some moderation of marks might be applied prior to final results being released.

Examination(s)

The course has a final exam.

Assessment Task 1

Quizzes (Redeemable against A1)

The course includes the following four assessment tasks: Quizzes (Q: 10 points), Assignment 1 (A1: 10 points), Assignment 2 Part 1 (A2.1: 20 points), Assignment 2 Part 2 (A2.2: 30 points). 

Out of Q and A1 only your best score will be counted towards your final grade, i.e., max(Q,A1).

A2.1 and A2.2 together will contribute at most 50 points to your final grade. From A2.1 and A2.2 either the sum or the scaled up score of A2.2 will be counted towards your final grade, i.e., max(A2.1+A2.2, A2.2*50/30)

Assessment tasks should be done individually, and no group work is allowed unless otherwise specified.

Q: In-person, in-class quizzes will be conducted during lectures. Students must attend lectures to attempt the quizzes. Only one attempt is allowed for each quiz. Each quiz can contribute at most 2 points to the final grade. Only your best 5 quizzes will be counted toward your grade of this assessment task for a maximum quiz contribution of 10 points in your final grade. Note that the quiz component is redeemable with A1 and the max(Q,A1) will count.  

This assessment task does not include a hurdle requirement.

Specific details are subject to change. Please monitor Canvas for updates and precise information in announcements.

Assessment Task 2

Assignment 1 (Redeemable against Quizzes)

The course includes the following four assessment tasks: Quizzes (Q: 10 points), Assignment 1 (A1: 10 points), Assignment 2 Part 1 (A2.1: 20 points), Assignment 2 Part 2 (A2.2: 30 points). 

Out of Q and A1 only your best score will be counted towards your final grade, i.e., max(Q,A1).

A2.1 and A2.2 together will contribute at most 50 points to your final grade. From A2.1 and A2.2 either the sum or the scaled up score of A2.2 will be counted towards your final grade, i.e., max(A2.1+A2.2, A2.2*50/30)

Assessment tasks should be done individually, and no group work is allowed unless otherwise specified.

A1: This assessment will require students to answer questions that reflect their understanding of course topics.

This assessment task does not include a hurdle requirement.

Specific details are subject to change. Please monitor Canvas for updates and precise information in announcements.

Assessment Task 3

Assignment 2 Part 1

The course includes the following four assessment tasks: Quizzes (Q: 10 points), Assignment 1 (A1: 10 points), Assignment 2 Part 1 (A2.1: 20 points), Assignment 2 Part 2 (A2.2: 30 points). 

Out of Q and A1 only your best score will be counted towards your final grade, i.e., max(Q,A1).

A2.1 and A2.2 together will contribute at most 50 points to your final grade. From A2.1 and A2.2 either the sum or the scaled up score of A2.2 will be counted towards your final grade, i.e., max(A2.1+A2.2, A2.2*50/30)

Assessment tasks should be done individually, and no group work is allowed unless otherwise specified.

A2: Assignment 2 is structured to allow students to engage with state-of-the-art or applied or novel areas relevant to the course and cover advanced results, research papers, tools, and methodologies. Artifacts generated here may include a scientific or technical report (suggested formats will be released), presentation or summarisation (suggested formats will be released), and any associated algorithm, code, or scripts. The two parts should build on each other.

A2.1: An initial submission of A2 will allow students to propose, analyse, discuss, and cover related progress in a problem or area of interest. A2.2 should build on A2.1.

***Note: This assessment task includes a hurdle requirement of 4 points.

Specific details are subject to change. Please monitor Canvas for updates and precise information in announcements.

Assessment Task 4

Assignment 2 Part 2

The course includes the following four assessment tasks: Quizzes (Q: 10 points), Assignment 1 (A1: 10 points), Assignment 2 Part 1 (A2.1: 20 points), Assignment 2 Part 2 (A2.2: 30 points). 

Out of Q and A1 only your best score will be counted towards your final grade, i.e., max(Q,A1).

A2.1 and A2.2 together will contribute at most 50 points to your final grade. From A2.1 and A2.2 either the sum or the scaled up score of A2.2 will be counted towards your final grade, i.e., max(A2.1+A2.2, A2.2*50/30)

Assessment tasks should be done individually, and no group work is allowed unless otherwise specified.

A2: Assignment 2 is structured to allow students to engage with state-of-the-art or applied or novel areas relevant to the course and cover advanced results, research papers, tools, and methodologies. Artifacts generated here may include a scientific or technical report (suggested formats will be released), presentation or summarisation (suggested formats will be released), and any associated algorithm, code, or scripts. The two parts should build on each other.

A2.2: A final submission of A2 will allow students to propose in detail, analyse rigorously, discuss extensively, cover related literature, solve, assess, and discuss in detail in a problem or area of interest.

This assessment task does not include a hurdle requirement.

Specific details are subject to change. Please monitor Canvas for updates and precise information in announcements.

Assessment Task 5

Final Exam

The final exam includes a hurdle requirement, which is passed by securing at least 30% of the maximum score attainable in the final exam.

Specific details are subject to change. Please monitor Canvas for updates and precise information in announcements.

Academic Integrity

Academic integrity is a core part of the ANU culture as a community of scholars. The University’s students are an integral part of that community. The academic integrity principle commits all students to engage in academic work in ways that are consistent with, and actively support, academic integrity, and to uphold this commitment by behaving honestly, responsibly and ethically, and with respect and fairness, in scholarly practice.

The University expects all staff and students to be familiar with the academic integrity principle, the Academic Integrity Rule 2021, the Policy: Student Academic Integrity and Procedure: Student Academic Integrity, and to uphold high standards of academic integrity to ensure the quality and value of our qualifications.

The Academic Integrity Rule 2021 is a legal document that the University uses to promote academic integrity, and manage breaches of the academic integrity principle. The Policy and Procedure support the Rule by outlining overarching principles, responsibilities and processes. The Academic Integrity Rule 2021 commences on 1 December 2021 and applies to courses commencing on or after that date, as well as to research conduct occurring on or after that date. Prior to this, the Academic Misconduct Rule 2015 applies.

 

The University commits to assisting all students to understand how to engage in academic work in ways that are consistent with, and actively support academic integrity. All coursework students must complete the online Academic Integrity Module (Epigeum), and Higher Degree Research (HDR) students are required to complete research integrity training. The Academic Integrity website provides information about services available to assist students with their assignments, examinations and other learning activities, as well as understanding and upholding academic integrity.

Online Submission

You will be required to electronically sign a declaration as part of the submission of your assignment. Please keep a copy of the assignment for your records. Unless an exemption has been approved by the Associate Dean (Education) submission must be through Turnitin.

Hardcopy Submission

For some forms of assessment (hand written assignments, art works, laboratory notes, etc.) hard copy submission is appropriate when approved by the Associate Dean (Education). Hard copy submissions must utilise the Assignment Cover Sheet. Please keep a copy of tasks completed for your records.

Late Submission

Individual assessment tasks may or may not allow for late submission. Policy regarding late submission is detailed below:

• Late submission not permitted. If submission of assessment tasks without an extension after the due date is not permitted, a mark of 0 will be awarded.

Referencing Requirements

The Academic Skills website has information to assist you with your writing and assessments. The website includes information about Academic Integrity including referencing requirements for different disciplines. There is also information on Plagiarism and different ways to use source material. Any use of artificial intelligence must be properly referenced. Failure to properly cite use of Generative AI will be considered a breach of academic integrity.

Returning Assignments

You will be asked questions during your presentation and will receive feedback.

Extensions and Penalties

Extensions and late submission of assessment pieces are covered by the Student Assessment (Coursework) Policy and Procedure. Extensions may be granted for assessment pieces that are not examinations or take-home examinations. If you need an extension, you must request an extension in writing on or before the due date. If you have documented and appropriate medical evidence that demonstrates you were not able to request an extension on or before the due date, you may be able to request it after the due date.

Privacy Notice

The ANU has made a number of third party, online, databases available for students to use. Use of each online database is conditional on student end users first agreeing to the database licensor’s terms of service and/or privacy policy. Students should read these carefully. In some cases student end users will be required to register an account with the database licensor and submit personal information, including their: first name; last name; ANU email address; and other information.
In cases where student end users are asked to submit ‘content’ to a database, such as an assignment or short answers, the database licensor may only use the student’s ‘content’ in accordance with the terms of service – including any (copyright) licence the student grants to the database licensor. Any personal information or content a student submits may be stored by the licensor, potentially offshore, and will be used to process the database service in accordance with the licensors terms of service and/or privacy policy.
If any student chooses not to agree to the database licensor’s terms of service or privacy policy, the student will not be able to access and use the database. In these circumstances students should contact their lecturer to enquire about alternative arrangements that are available.

Distribution of grades policy

Academic Quality Assurance Committee monitors the performance of students, including attrition, further study and employment rates and grade distribution, and College reports on quality assurance processes for assessment activities, including alignment with national and international disciplinary and interdisciplinary standards, as well as qualification type learning outcomes.

Since first semester 1994, ANU uses a grading scale for all courses. This grading scale is used by all academic areas of the University.

Support for students

The University offers students support through several different services. You may contact the services listed below directly or seek advice from your Course Convener, Student Administrators, or your College and Course representatives (if applicable).

• ANU Health, safety & wellbeing for medical services, counselling, mental health and spiritual support
• ANU Accessibility for students with a disability or ongoing or chronic illness
• ANU Dean of Students for confidential, impartial advice and help to resolve problems between students and the academic or administrative areas of the University
• ANU Academic Skills supports you make your own decisions about how you learn and manage your workload.
• ANU Counselling promotes, supports and enhances mental health and wellbeing within the University student community.
• ANUSA supports and represents all ANU students