• Offered by School of Computing
  • ANU College ANU College of Engineering Computing & Cybernetics
  • Course subject Computer Science
  • Areas of interest Bioinformatics, Computer Science, Mathematics, Information Technology, Software Engineering More...
  • Academic career UGRD
  • Mode of delivery In Person
  • Co-taught Course
  • Offered in Second Semester 2025
    See Future Offerings
  • STEM Course

This course is an Advanced variation on Structured Programming (COMP1110 ). It covers the same topics in more depth, requiring additional contact hours to allow students to deepen their understanding and experience of software development. Students will use, apply, and deploy structured programming techniques in a diverse range of application domains.

As the advanced version of the course the first six Learning Outcomes are the same as for COMP1110.


Learning Outcomes

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

  1. Apply fundamental programming concepts, using an object oriented programming language, to solve substantial problems.
  2. Understand basic types and the benefits of static typing for object oriented programs.
  3. Develop, understand, test, and evolve substantial programs using a modern IDE, and associated configuration tools; understand common coding errors and how to avoid them; practice fundamental defensive programming; perform individual and team program reviews; use established design principles to organize a software system.
  4. Use, execute and evaluate fundamental data structures and associated algorithms; create, implement, debug, and evaluate algorithms for solving substantial problems; implement an abstract data type.
  5. Apply basic algorithmic analysis to simple algorithms; use appropriate algorithmic approaches to solve problems.
  6. Deliver and evaluate basic technical documents, presentations, and group interactions, using appropriate tools.
  7. Explain the relationship between object-oriented inheritance (code-sharing and overriding) and subtyping (the idea of a subtype being usable in a context that expects the supertype).
  8. Use object-oriented encapsulation mechanisms such as interfaces and private members, and define and use iterators and other operations over aggregate values that take functions as arguments. 
  9. Define and use program pieces (such as functions, classes, methods) that use generic types, including for collections. 
  10. Explain how programming language implementations typically organize memory into global data, text, heap, and stack sections and how features such as recursion and memory management map to this memory model.
  11. Discuss the benefits and limitations of garbage collection, including the notion of reachability.

Other Information

For more information visit the COMP1100 course site.

This course may be taken as an alternative to Structured Programming COMP1110 and satisfies all prerequisites that would be satisfied by that course.

Indicative Assessment

  1. Individual Assignments and Lab Tests (5) [LO 1,2,3,4]
  2. Group Assignments and Engagement (35) [LO 1,2,3,4,5,6,7,8,9,10,11]
  3. Final Exam (50) [LO 1,2,3,4,5,6]

The ANU uses 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. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website.


Lectures, labs/tutorial and self study to a total of 130 hours.

Inherent Requirements


Requisite and Incompatibility

To enrol in this course you must have successfully completed COMP1130. You are not able to enrol in this course if you have previously completed COMP1110 or COMP1510.

Prescribed Texts

See COMP1100

Areas of Interest

  • Bioinformatics
  • Computer Science
  • Mathematics
  • Information Technology
  • Software Engineering
  • Advanced Computing
  • Information Systems
  • Human Centred Computing
  • Information - Intensive Computing
  • Intelligent Systems
  • Software Development
  • Algorithms and Data
  • Artifical Intelligence
  • Computer Systems
  • Computer Engineering
  • Computational Foundations


Tuition fees are for the academic year indicated at the top of the page.  

Commonwealth Support (CSP) Students
If you have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). More information about your student contribution amount for each course at Fees

Student Contribution Band:
Unit value:
6 units

If you are a domestic graduate coursework student with a Domestic Tuition Fee (DTF) place or international student you will be required to pay course tuition fees (see below). Course tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees.

Where there is a unit range displayed for this course, not all unit options below may be available.

6.00 0.12500
Note: Please note that fee information is for current year only.

Offerings, Dates and Class Summary Links

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.

Second Semester

Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary
8865 21 Jul 2025 28 Jul 2025 31 Aug 2025 24 Oct 2025 In Person N/A

Responsible Officer: Registrar, Student Administration / Page Contact: Website Administrator / Frequently Asked Questions