COSC413-14S1 (C) Semester One 2014

Advanced Topics in Algorithms

24 Feb 2014 - 29 Jun 2014


Advanced topics in algorithms, such as NP-completeness and intractability, randomized algorithms, number theoretic algorithms for cryptology, parallel algorithms, etc.

We learn cryptography and complexity theory in this course. This course will give a clear explanation of NP-completeness theory. Then algorithms on number theory needed for the RSA cryptosystem will be given in detail. The advanced topic of random algorithms will also be discussed.

Learning Outcomes


Subject to approval of the Head of Department.

Streams Day Time Where Notes
Stream 01 Wednesday 1:00pm-3:00pm Erskine 315 24 Feb - 13 Apr,
5 May - 8 Jun

Course Coordinator

Tad Takaoka


Assessment Due Date Percentage 
Assignment 1 - Cryptography 20%
Assignment 2 - Complexity Theory 30%
Final Exam 50%


Hopcroft and Ullman (recommended text), Design and Analysis of Computer Algorithms, Addison-Wesley,1974.
D. E. Knuth, The Art of Programming, Vol 2 : Semi-numerical Algorithms , Addison-Wesley, 1997

Additional Course Outline Information

Grade moderation

The Computer Science department's grading policy states that in order to pass a course you must meet two requirements:
1. You must achieve an average grade of at least 50% over all assessment items.
2. You must achieve an average mark of at least 45% on invigilated assessment items.
If you satisfy both these criteria, your grade will be determined by the following University- wide scale for converting marks to grades: an average mark of 50% is sufficient for a C- grade, an average mark of 55% earns a C grade, 60% earns a B- grade and so forth. However if you do not satisfy both the passing criteria you will be given either a D or E grade depending on marks. Marks are sometimes scaled to achieve consistency between courses from year to year.

If factors beyond your control (such as illness or family bereavement) prevent you from completing some item of course work (including laboratory sessions), or prevent you from giving your best, then you may be eligible for aegrotat, impaired performance consideration or an extension on the assessment. Details of these may be found in the University Calendar. Supporting evidence, such as a medical certificate, is normally required. If in doubt, talk to your lecturer.

Indicative Fees

Domestic fee $881.00

* Fees include New Zealand GST and do not include any programme level discount or additional course related expenses.

For further information see Computer Science and Software Engineering.

All COSC413 Occurrences

  • COSC413-14S1 (C) Semester One 2014