This unit investigates topics from discrete mathematics in the broad areas of logic, sequences and proofs, sets, relations and probability, graphs and trees, and regular expressions and finite-state automata. Students will gain an understanding of the core elements in each of these areas and see how they build to important properties and/or theories. The treatment of these topics will cover both practical and theoretical aspects and will usually include at least one important application relevant to Information Technology.

This unit may be co-taught with 6698 Discrete Mathematics.

Learning outcomes

On successful completion of this unit, students will be able to:
1. Manipulate the language and notation of symbolic logic in order to apply to complex digital logic circuits;
2. Construct a variety of proofs in a clear explanatory manner by utilising underlying principles of proofs;
3. Apply the notation of sets to investigate relations and their properties;
4. Analyse and create finite-state automata; and
5. Investigate properties of complex graphs and trees within a real-world application.

Graduate attributes

1. UC graduates are professional - communicate effectively
1. UC graduates are professional - use creativity, critical thinking, analysis and research skills to solve theoretical and real-world problems
1. UC graduates are professional - display initiative and drive, and use their organisation skills to plan and manage their workload
3. UC graduates are lifelong learners - adapt to complexity, ambiguity and change by being flexible and keen to engage with new ideas
3. UC graduates are lifelong learners - reflect on their own practice, updating and adapting their knowledge and skills for continual professional and academic development

Prerequisites

None.

Corequisites

None.

Incompatible units

6698 Discrete Mathematics

Equivalent units

None.

Assumed knowledge

Year 12 mathematics.