This course presents some formal notations that are commonly used for the description of computation and of computing systems, for the specification of software and for mathematically rigorous arguments about program properties.

The following areas of study constitute the backbone of the course. Predicate calculus and natural deduction, inductive definitions of data types as a basis for recursive functions and structural induction, formal language theory (particularly regular expressions, finite state machines and context free grammars), specification languages, propositional programming language semantics, partial correctness and proofs of termination.

## Learning Outcomes

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

Upon completion of this course, the student will be able to do the following:

- Apply the concepts of standard mathematical logic to produce proofs or refutations of well-formed propositions or arguments phrased in English or in a variety of formal notations (first order logic, discrete mathematics or Hoare Logic).
- Given a description of a regular language, either in English, as a regular expression or as a grammar, generate a finite state automaton that recognizes that language. Similarly, given a deterministic or nondeterministic automaton, give a description of the language which it accepts.
- Given an inductive definition of a simple data structure, write a recursive definition of a given simple operation on data of that type. Given some such recursively defined operations, prove simple properties of these functions using the appropriate structural induction principle.
- Prove simple programs correct using Hoare Logic and Separation Logic.
- Prove correctness and termination of a simple program using the weakest precondition calculus.
- Design a Turing Machine which will accomplish simple tasks.

**Professional Skills Mapping**

Mapping of Learning Outcomes to Assessment and Professional Competencies

## Indicative Assessment

Assignments (36%); Tutorials (4%); Quiz (10%); Final Exam (50%)

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.

## Workload

Thirty one-hour lectures and nine one-hour tutorials.

## Requisite and Incompatibility

## Prescribed Texts

There is no prescribed text for COMP2600, but the following are recommended references. More may be added as the semester progresses.

Grassman, Winfried Karl Grassman & Tremblay, Jean-Paul Logic and Discrete Mathematics: A Computer Science Perspective, Prentice Hall, Upper Saddle River, New Jersey, 1996.

Thompson, Simon Haskell: The Craft of Functional Programming, International Computer Science Series. Addison-Wesley, Wokingham, England, 1999.

Epp, Susanna S. Discrete Mathematics with ApplicationsComputer Science Press, New York, 1995.

Bergmann, Merrie The Logic Book, McGraw-Hill.

Munro, John Discrete Mathematics for Computing Thomas Nelson.

## Majors

## Minors

## Fees

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

If you are a domestic graduate coursework or international student you will be required to pay tuition fees. Tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at **Fees**.

- Student Contribution Band:
- 2
- Unit value:
- 6 units

If you are an undergraduate student and 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). You can find your student contribution amount for each course at **Fees**. Where there is a unit range displayed for this course, not all unit options below may be available.

Units | EFTSL |
---|---|

6.00 | 0.12500 |

## Course fees

- Domestic fee paying students

Year | Fee |
---|---|

2015 | $3096 |

- International fee paying students

Year | Fee |
---|---|

2015 | $4146 |

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

## Offerings, Dates and Class Summary Links

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

1396 | 20 Jul 2015 | 07 Aug 2015 | 31 Aug 2015 | 30 Oct 2015 | In Person | N/A |