Introduction to Programming and Algorithms COMP1100

Learning outcomes

More information may be available for enrolled students on the course website at http://cs.anu.edu.au/students/comp1100

Students who succeed in all aspects of this course will be able to:

1. Describe and contrast various algorithmic components, and relate them to specific corresponding data structures.
2. Analyse program fragments and explain their types, behaviours and effects.
3. Design algorithmic solutions to simple problems and present their implementation in a functional programming language.
4. Design data structures appropriate for the representation and implementation of simple algorithmic problems.
5. Analyse small programming problems to suggest, design and implement appropriate modular program structures.