It's UWAweek 47
|
unitinfo
This page provides helpful information about many coursework units offered by
Computer Science and Software Engineering
in 2023.
The information here is not official -
for official information please see the
current UWA Handbook.
Instead, it will help students to prepare for their future units,
before the beginning of each semester,
and before they have access to
UWA's
Learning Management System (LMS).
|
About the unit CITS2211 Discrete Structures (2nd semester 2023)
Unit description:
This unit contains an overview of the mathematical foundations of computer science including basic set theory and logic, formal proof methodologies, and automata theory. The unit applies this knowledge to real problems in computer science and software engineering, specifically the demonstration of program correctness and the specification of computer systems. Topics include set theory, relations, functions, predicate logic, formal proofs of correctness, finite state automata and automata theory.
Unit outcomes:
Students are able to (1) demonstrate critical thinking and information literacy; (2) understand the mathematical foundations of computer science and the evolution and history of the discipline; (3) demonstrate a familiarity with basic set theory, relations, functions, predicate logic, correctness proofs, finite state automata and automata theory as tools used in computer science and software engineering; (4) identify, abstract and analyse problems in computer science and software engineering using the mathematical models; and (5) apply logical reasoning to problems in software engineering.
Unit coordinator:
Unit homepage:
|
|
Unit is offered in these majors and courses:
Indicative weekly topics:
| week 1 |
Introduction & Propositional Logic |
| week 2 |
Predicate Logic |
| week 3 |
Proofs |
| week 4 |
Proof by Induction |
| week 5 |
Sets and Relations |
| week 6 |
Functions |
| week 7 |
Partial Orders and Equivalence Relations |
| week 8 |
Cardinality and Countability |
| week 9 |
Finite State Machines |
| week 10 |
Regular Languages |
| week 11 |
Context-Free Languages |
| week 12 |
Turing Machines and the Halting Problem |
Indicative assessment:
tests, assignments, final exam
Useful prior experience and background knowledge:
MATH1721
Operating system(s) used in this unit:
Different units will use different operating systems for their teaching - for in-class examples, laboratory exercises, and programming projects.
If an operating system is REQUIRED, it will be used when marking assessments.
ANY reasonable platform
This information last updated 3:16pm Sat 15th Apr 2023
