Not offered in 2006.
Synopsis: This unit provides students with advanced techniques for designing and analysing complex algorithms. In particular, it teaches advanced search strategies, how to select an appropriate search stategy for a given problem, advanced techniques for analysis of algorithmic complexity, dynamic programming, basic statistics to estimate program behaviour, Monte Carlo simulation techniques, and basic notions in computability such as NP completeness.
Assessment: Assignments: 30%; Compulsory assessed laboratory classes: 10%; Examination (3 hours): 60%.
Contact Hours: One x 2 hr lecture/week, One x 0.5 hr tutorial/week, One x 1.5 hr laboratory/week