CSE3305

Formal methods II (6 points)

(IT)

Leader: TBA

Offered:
Clayton First semester 2003 (Day)
Malaysia First semester 2003 (Day)
Clayton First semester 2004 (Day)
Malaysia First semester 2004 (Day)

Synopsis: Information theory in particular types of codings, entropy, information rate, communication channels. Shannon's coding theorems. A review of probability theory. Introduction to the simulation of discrete stochastic processes and Monte Carlo methods. Intractable problems: P, NP, and P-Space complexity classes; Cook's theorem and its application to proving NP-completeness. Approximate solutions to intractable problems.

Assessment: Examination (3 hours): 70% + Assignments: 30%

Contact Hours: Two 1-hour lectures per week and one 1-hour tutorial per fortnight

Prerequisites: CSC2030 or CSE2303 and CSC2040 or CSE2304