COSC413-13S1 (C) Semester One 2013

Advanced Topics in 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

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.

Prerequisites

Subject to approval of the Head of Department.

Course Coordinator

Tad Takaoka

Assessment

Assessment Due Date Percentage 
Assignment 1 - Cryptography 22 Apr 2013 25%
Assignment 2 - Complexity Theory 10 May 2013 25%
Exam 50%

Textbooks / Resources

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

Indicative Fees

Domestic fee $847.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 COSC413 Occurrences

  • COSC413-13S1 (C) Semester One 2013
  • COSC413-13S2 (C) Semester Two 2013 - Not Offered
Next year