1246
Comment:

← Revision 4 as of 20091223 14:49:51 ⇥
1234
converted to 1.6 markup

Deletions are marked like this.  Additions are marked like this. 
Line 19:  Line 19: 
Taken by George Milne and Tim French.  Taken by GeorgeMilne and TimFrench. 
Line 22:  Line 22: 
[http://undergraduate.csse.uwa.edu.au/units/CITS2211 Unit website]  [[http://undergraduate.csse.uwa.edu.au/units/CITS2211Unit website]] 
Line 24:  Line 24: 
[http://units.handbooks.uwa.edu.au/units/cits/cits2211 Handbook entry]  [[http://units.handbooks.uwa.edu.au/units/cits/cits2211Handbook entry]] 
Line 27:  Line 27: 
CategoryUnits CategoryUnits  CategoryUnits 
Discrete structures is about basic mathematical structures which are used in computer science. This is one of your ubiquitous Computer Science units that talks about Computer Science stuff.
Topics in this unit
 Propositional Logic
 Predicate Logic
 Sets
 Relations (partial orderings, equivalence classes, etc)
 Functions
 Finite automata
 Finite state machines
 Turing Machines (halting problem woohoo)
 Proofs (lots of these, including weak induction and strong induction)
 Proofs of correctness for programs
Lecture notes are given out during lectures and are based on the textbook (Gersting, which costs about $200 if you want to buy it!).
Tutorials are assessed based on effort. It's recommended that you do them because no tutorial answers are given out and the exam is based on tutorial like questions. You also need to get a lot of practice to do the questions assigned in the unit well.
Taken by GeorgeMilne and TimFrench. Both lecturers make an effort to make the topic somewhat interesting, but fight a losing battle.