Authorised by Academic Registrar, April 1996
Objectives On completion of the subject students will be able to assess the feasibility of programming tasks; classify the resource requirements of programs; understand the difference between computer power and speed; design and use universal computer languages.
Synopsis This subject covers models of computation and the limits of computability, computational complexity, the theory of P and NP, NP-completeness, practical approaches to solving NP-complete problems.
Assessment Examination (2 hours): 70% + Practical work: 30%