Students
COMP2010 – Algorithms and Data Structures
2026 – Session 1, In person-scheduled-weekday, North Ryde
General Information
Download as PDF
| Unit convenor and teaching staff |
Unit convenor and teaching staff
Convenor (weeks 1-6)
Michael Lay-Kujiraoka
Contact via email
Lecturer (weeks 1-6)
Pedro Arruda Faustini
Contact via email
Lecturer, Convenor (weeks 7-12)
Mark Dras
Contact via email
|
|---|---|
| Credit points |
Credit points
10
|
| Prerequisites |
Prerequisites
COMP1010 and 10cp from (MATH1007 - MATH1025 or STAT1250 or STAT1170 or STAT1371)
|
| Corequisites |
Corequisites
|
| Co-badged status |
Co-badged status
COMP6011
|
| Unit description |
Unit description
This unit provides a study of algorithms, data structures and programming techniques. The topics covered include: trees; graphs and heaps; advanced sorting techniques; elements of storage management; and complexity. The presentation emphasises the role of data abstraction and correctness proofs. |
Important Academic Dates
Information about important academic dates including deadlines for withdrawing from units are available at https://www.mq.edu.au/study/calendar-of-dates
Learning Outcomes
On successful completion of this unit, you will be able to:
- ULO1: Demonstrate an understanding of a variety of algorithm design techniques and how they can improve either efficiency or clarity.
- ULO2: Apply strategies for achieving correctness in a range of algorithms.
- ULO3: Apply commonly used data structures, including trees, graphs, lists and their variations.
- ULO4: Carry-out advanced and broadly based problem solving, particularly when designing and writing programs to meet a given specification.
- ULO5: Describe the results of analysing algorithms.
General Assessment Information
Requirements to Pass
- Achieve a total mark equal to or greater than 50%.
Release of Assessments
- Algorithmic Coding Task One: To be released no later than 31/3/26.
- Algorithmic Coding Task Two: To be released no later than 12/5/26.
Late Submission Policy
- 5% penalty per day: If you submit your assessment late, 5% of the total possible marks will be deducted for each day (including weekends), up to 7 days.
- Example 1 (out of 100): If you score 85/100 but submit 20 hours late, you will lose 5 marks and receive 80/100.
- Example 2 (out of 30): If you score 27/30 but submit 1 day late, you will lose 1.5 marks and receive 25.5/30.
- After 7 days: Submissions more than 7 days late will receive a mark of 0.
- Extensions:
- Special Consideration: If you need more time due to serious issues and for any assessments that are not eligible for Short Extension, you must apply for Special Consideration. Need help? Review the Special Consideration page HERE.
- Assessments where Late Submissions will be accepted:
- Algorithmic Coding Task One – YES, Standard Late Penalty applies.
- Algorithmic Coding Task Two – YES, Standard Late Penalty applies.
- Final Exam – NO, unless Special Consideration is Granted
Special Consideration
The Special Consideration Policy aims to support students who have been impacted by short-term circumstances or events that are serious, unavoidable and significantly disruptive, and which may affect their performance in assessment. If you experience circumstances or events that affect your ability to complete the assessments in this unit on time, please inform the convenor and submit a Special Consideration request through http://connect.mq.edu.au/.
Assessment Tasks
| Name | Weighting | Hurdle | Due | Groupwork/Individual | Short Extension | AI Approach |
|---|---|---|---|---|---|---|
| Algorithmic Coding Task One | 20% | No | 14/04/2026 | Individual | Yes | Open |
| Algorithmic Coding Task Two | 30% | No | 26/05/2026 | Individual | Yes | Open |
| Final Exam | 50% | No | Exam period | Individual | No | Observed |
Algorithmic Coding Task One
Assessment Type 1: Experiential task
Indicative Time on Task 2: 15 hours
Due: 14/04/2026
Weighting: 20%
Groupwork/Individual: Individual
Short extension 3: Yes
AI Approach: Open
You will design, implement (using Java), and analyse algorithms based on design techniques covered in lectures and exercises, focusing on correctness and effective use of lists, trees, or similar data structures.
On successful completion you will be able to:
- Demonstrate an understanding of a variety of algorithm design techniques and how they can improve either efficiency or clarity.
- Apply strategies for achieving correctness in a range of algorithms.
- Apply commonly used data structures, including trees, graphs, lists and their variations.
- Carry-out advanced and broadly based problem solving, particularly when designing and writing programs to meet a given specification.
Algorithmic Coding Task Two
Assessment Type 1: Experiential task
Indicative Time on Task 2: 25 hours
Due: 26/05/2026
Weighting: 30%
Groupwork/Individual: Individual
Short extension 3: Yes
AI Approach: Open
You will design and implement algorithms in Java using graphs or other advanced data structures, applying techniques covered in the second half of the unit.
On successful completion you will be able to:
- Demonstrate an understanding of a variety of algorithm design techniques and how they can improve either efficiency or clarity.
- Apply strategies for achieving correctness in a range of algorithms.
- Apply commonly used data structures, including trees, graphs, lists and their variations.
- Carry-out advanced and broadly based problem solving, particularly when designing and writing programs to meet a given specification.
Final Exam
Assessment Type 1: Examination
Indicative Time on Task 2: 20 hours
Due: Exam period
Weighting: 50%
Groupwork/Individual: Individual
Short extension 3: No
AI Approach: Observed
You will sit an end-of-session exam that covers contents from the entire unit.
On successful completion you will be able to:
- Demonstrate an understanding of a variety of algorithm design techniques and how they can improve either efficiency or clarity.
- Apply strategies for achieving correctness in a range of algorithms.
- Apply commonly used data structures, including trees, graphs, lists and their variations.
- Carry-out advanced and broadly based problem solving, particularly when designing and writing programs to meet a given specification.
- Describe the results of analysing algorithms.
1 If you need help with your assignment, please contact:
- the academic teaching staff in your unit for guidance in understanding or completing this type of assessment
- Academic Success for academic skills support.
2 Indicative time-on-task is an estimate of the time required for completion of the assessment task and is subject to individual variation.
3 An automatic short extension is available for some assessments. Apply through the Service Connect Portal.
Delivery and Resources
Week 1 classes
Lectures will take place in week 1. Workshops will begin in week 2.
Methods of Communication
We will communicate with you via your university email and through announcements on iLearn. Queries to convenors can either be placed on the iLearn discussion board or sent to the unit convenor via the contact email on iLearn.
Unit Schedule
| Week 1 | Review of algorithms and related concepts |
| Week 2 | Algorithm Correctness and Efficiency |
| Week 3 | Algorithm Design Strategies |
| Week 4 | Sorting |
| Week 5 | Binary Trees |
| Week 6 | Binary Trees (cont.) |
| Week 7 |
Priority Queues, Heaps and Heapsort |
| Week 8 | Programming with Maps and Hashtables |
| Week 9 | Graph Algorithms |
| Week 10 | Graph Algorithms (cont.) |
| Week 11 | Advanced Trees |
| Week 12 | An Introduction to Computability |
| Week 13 |
Revision |
Policies and Procedures
Macquarie University policies and procedures are accessible from Policy Central (https://policies.mq.edu.au). Students should be aware of the following policies in particular with regard to Learning and Teaching:
- Academic Appeals Policy
- Academic Integrity Policy
- Academic Progression Policy
- Assessment Policy
- Fitness to Practice Procedure
- Assessment Procedure
- Complaints Resolution Procedure for Students and Members of the Public
- Special Consideration Policy
Students seeking more policy resources can visit Student Policies (https://students.mq.edu.au/support/study/policies). It is your one-stop-shop for the key policies you need to know about throughout your undergraduate student journey.
To find other policies relating to Teaching and Learning, visit Policy Central (https://policies.mq.edu.au) and use the search tool.
Student Code of Conduct
Macquarie University students have a responsibility to be familiar with the Student Code of Conduct: https://students.mq.edu.au/admin/other-resources/student-conduct
Results
Results published on platform other than eStudent, (eg. iLearn, Coursera etc.) or released directly by your Unit Convenor, are not confirmed as they are subject to final approval by the University. Once approved, final results will be sent to your student email address and will be made available in eStudent. For more information visit connect.mq.edu.au or if you are a Global MBA student contact globalmba.support@mq.edu.au
Academic Integrity
At Macquarie, we believe academic integrity – honesty, respect, trust, responsibility, fairness and courage – is at the core of learning, teaching and research. We recognise that meeting the expectations required to complete your assessments can be challenging. So, we offer you a range of resources and services to help you reach your potential, including free online writing and maths support, academic skills development and wellbeing consultations.
Student Support
Macquarie University provides a range of support services for students. For details, visit http://students.mq.edu.au/support/
Academic Success
Academic Success provides resources to develop your English language proficiency, academic writing, and communication skills.
- Workshops
- Chat with a WriteWISE peer writing leader
- Access StudyWISE
- Upload an assignment to Studiosity
- Complete the Academic Integrity Module
The Library provides online and face to face support to help you find and use relevant information resources.
Student Services and Support
Macquarie University offers a range of Student Support Services including:
- IT Support
- Accessibility and disability support with study
- Mental health support
- Safety support to respond to bullying, harassment, sexual harassment and sexual assault
- Social support including information about finances, tenancy and legal issues
- Student Advocacy provides independent advice on MQ policies, procedures, and processes
Student Enquiries
Got a question? Ask us via the Service Connect Portal, or contact Service Connect.
IT Help
For help with University computer systems and technology, visit http://www.mq.edu.au/about_us/offices_and_units/information_technology/help/.
When using the University's IT, you must adhere to the Acceptable Use of IT Resources Policy. The policy applies to all who connect to the MQ network including students.
Changes from Previous Offering
We value student feedback to be able to continually improve the way we offer our units. As such we encourage students to provide constructive feedback via student surveys, to the teaching staff directly, or via the FSE Student Experience & Feedback link in the iLearn page.
For 2026, the main change has been to bring the assessment policy in line with the 3AM model. There are consequently just the three assessments that are similar to the major assignments and exam of previous years.
Changes since First Published
| Date | Description |
|---|---|
| 18/02/2026 | Changed assignment submission dates to account for short extensions. |
Unit information based on version 2026.06 of the Handbook