| Monash home | About Monash | Faculties | Campuses | Contact Monash |
| Staff directory | A-Z index | Site map |
|
FIT3014 - Analysis and design of algorithms6 points, SCA Band 2, 0.125 EFTSLUndergraduate Faculty of Information TechnologyLeader: Associate Professor David DoweOffered
Clayton First semester 2008 (Day) SynopsisThis 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% Contact hours4 hours per week PrerequisitesFIT2004 or CSE2304 ProhibitionsCSE3305 |