In general terms, an algorithm is a precise computational process for producing a specific result from some given input data. A program is a formal definition of an algorithm, in a notation that can be mechanically translated and then executed by a modern computer.

The core unifying theme of the course is data-directed design. The course introduces fundamental algorithmic structures such as composition (sequence), choice and repetition, predominantly using a functional programming language as the vehicle of expression. The course introduces fundamental data types and structures such as products (tuples), lists, and unions. A key aim is to illustrate the interdependancy of algorithms and data structures - significantly, that data structures largely determine algorithms, for example, that products are processed by projections, unions by alternatives, and that recursive data structures such as lists are processed by recursive algorithms.

For all but the simplest programs, some means of abstraction and structuring is required to manage the complexities faced by programmers, as individuals and as groups. The course introduces modularisation techniques such as libraries and abstract data types, as a means of managing such complexity. Good modular design is of fundamental and practical importance for program development - adhering to the theme of data-directed design adopted in this course leads to elegant and maintainable programs.

The final section of the course revisits the most important aspects covered in the course, but now in the context of an object-oriented programming language. The aim is to thereby emphasise the concepts, rather than any particular implementation, and to provide a springboard to subsequent programming courses.

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

• describe and contrast various algorithmic components, and relate them to specific corresponding data structures.
• analyse program fragments and explain their types, behaviours and effects.
• design algorithmic solutions to simple problems and present their implementation in a functional programming language and an object-oriented programming language.
• design data structures appropriate for the representation and implementation of simple algorithmic problems.
• analyse small programming problems to suggest, design and implement appropriate modular program structures, based on a data-directed approach.

Continuous Assessment (40%); Examinations (60%)

Students are assumed to have achieved a level of knowledge of mathematics comparable to at least ACT Maths Methods major or NSW 2 unit maths or equivalent.