COSC262-13S1 (C) Semester One 2013

Algorithms

15 points

Details:
Start Date: Monday, 18 February 2013
End Date: Sunday, 23 June 2013
Withdrawal Dates
Last Day to withdraw from this course:
  • Without financial penalty (full fee refund): Friday, 1 March 2013
  • Without academic penalty (including no fee refund): Friday, 17 May 2013

Description

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.

Learning Outcomes

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.

Prerequisites

(1) COSC121; (2) COSC122; (3) 15 points from Mathematics, Statistics, Engineering Mathematics or MSCI110.  MATH101 is not acceptable. MATH120/STAT101 are strongly recommended.

Restrictions

COSC202, COSC229, COSC329

Course Coordinator / Lecturer

Ramakrishnan Mukundan

Lecturer

Tad Takaoka

Assessment

Assessment Due Date Percentage 
Assignment One 25%
Assignment Two 25%
Exam 50%

Indicative Fees

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 .

All COSC262 Occurrences

  • COSC262-13S1 (C) Semester One 2013
Previous year Next year