Academic Item Menu

Overview

Scope: * Mathematical methods for designing correct and efficient programs.* Mathematics for algorithm analysis.* Logic for proving and verification.Topics: * Introduction to set and relation theory* Propositional logic and boolean algebras* Induction, recursion and recurrence relations* Order of growth of functions.* Structured counting (combinatorics)* Discrete probability* Graph theory* Trees for algorithmic applications
Study Level

Postgraduate

Offering Terms

Term 1, Term 2, Term 3

Campus

Kensington

Delivery Mode

Fully on-site

Indicative contact hours

4

Course Outline

To access course outline, please visit:

Fees

Pre-2019 Handbook Editions

Access past handbook editions (2018 and prior)

Helpful utilities like sharing or printing this page
Share Link via Email
Download PDF