The course studies various algorithm design techniques, such as divide and conquer, and dynamic programming. These techniques are applied to design highly non-trivial algorithms from various areas of computer science. Topics include: advanced data structures; graph algorithms; searching algorithms; geometric algorithms; overview of NP-complete problems.

Prerequisite: CSIS1119 or COMP2119 or ELEC1502 or ELEC1503 or ELEC2543
Assessment: 50% continuous assessment, 50% examination