Use the Tab and Up, Down arrow keys to select menu items.
This course teaches a range of fundamental algorithms and analyses their complexity.
The course is divided into two parts. The first part of the course covers efficient sorting algorithms and graph algorithms, followed by a discussion of combinatorial generation. The second part of the course covers important application oriented topics, including pattern matching, computational geometry, and algorithms in number theory.
Students will develop the necessary skills for designing and implementing efficient algorithms for a wide range of practical problems, and will be able to analyse and compare different algorithms used in an application domain.
(1) COSC121; (2) COSC122; (3) 15 points from Mathematics, Statistics, Engineering Mathematics or MSCI110. MATH101 is not acceptable. MATH120/STAT101 are strongly recommended.
COSC202, COSC229, COSC329
Ramakrishnan Mukundan
Tad Takaoka
Course Information on Computer Science and Software Engineering website Course Information on Learn
Domestic fee $719.00
International fee $3,325.00
* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.
For further information see Computer Science and Software Engineering .