CSE3305

Formal methods II

(IT)

6 points + Two 1-hour lectures per week and one 1-hour tutorial per fortnight + First semester + Clayton, Malaysia + Prerequisites: CSC2030 or CSE2303 and CSC2040 or CSE2304

Synopsis: Information theory in particular types of codings, entropy, information rate, communication channels. Shannon0s 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; Cook0s theorem and its application to proving NP-completeness. Approximate solutions to intractable problems.

Assessment: Examination (3 hours): 60% + Assignments: 40%