School of Computer Science & Software Engineering
CITS2211 Handouts
Some handouts below are from 2008. Most will not be changed
a great deal, although the order of delivery may be varied.
Topic
Lecture notes & tutesheets
L e c t o p i a r e c o r d i n g s
Sets and counting
1. Sets and counting
Tute 1 with solns
Relations
2. Relations
Tute 2 with solns
Tute 3 with solns
Tute 4 with solns
3. Partial orderings and partitions
4. Relations and databases
5. Functions
Logic and proofs
6. Logic and symbolic representation
Tute 5 with solns
Tute 6 with solns
Mid-term (4/9)
7. Predicate logic
8. Proofs
9. Validity in predicate logic
10. Proof techniques
11. Mathematical induction
Mid-semester break
Automata
12. Finite state machines
Tute 7 with solns
Tute 8 with solns
13. Non-deterministic FSMs
14. Regular expressions and FSMs
15. Minimising FSMs
Turing machines
16. Turing machines
Tute 9 with solns
17. Tractability and computability
Formal languages and grammars
18. Formal languages and grammars
Tute 10 with solns
19. Context-free grammars
Handouts
Assessment
Noticeboard
Textbook
Help!
MathWorld
Unit outline
Lyndon While
