Computer programs as a formal definition of a desired method or outcome (algorithm) are cornerstones in almost any current product design. Those programs are then mechanically translated and executed on a computer.

The course introduces the art of programming in small steps, starting from clearly structuring the required data. Typed functions, conditional expressions, and repetition (recursion) are introduced alongside as the basic methods to operate on this structured data. 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.

Programs also require time to execute in a computer system. Basic understanding of the relation between program design and execution time is an essential part of an efficient design.

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 and abstract data types, as a means of managing such complexity. Modular design is of fundamental and practical importance for program development and leads to elegant and maintainable programs.

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%)

Twenty two one-and-a-half-hour lectures, ten two-hour tutorial/laboratory sessions. At least the same amount of time will be required to work through the material, and prepare labs and assignments.

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.

COMP1130