Monash University > School of Computer Science and Software Engineering > CSE2303

CSE2303 Formal Methods I
Semester 1, 2005

Welcome

This subject looks at the question of exactly what a computer can compute, and gives an introduction to logic and formal languages. Topics include computable functions, finite state automata, regular expressions, grammars, Turing computability, propositional logic, resolution, and predicate logic.

Lecturer

Exam Consultations

Prescribed Textbook

Recommended Reading

Lectures

• Tuesday 1.00 p.m. (C1)
• Thursday 11.00 a.m. (C1)

• Schedule of lectures, labs and tutorials (Clayton).
• Online versions.
• Audio tapes

Resources

• Introductory information
• Announcements. Watch this space.
• Discussion Group. Watch this space.
• Handbook entry.
• Assessment details, including procedures for missed pracs/tutes.
• People, including those you can seek help from during the semester.
• Tutorials.
• Practical Classes.
• Sample Exams
  Exam 1 (postscript), (pdf).
  Exam 2 (postscript), (pdf).
  Exam 3 (postscript), (pdf).
  Exam 4 (postscript), (pdf).
  Exam 5 (postscript), (pdf).
  Exam 6 (postscript), (pdf).
• FTP directory
• Useful Links

Last modified 3/6/2005