goto UNSW home page  
Contacts Library myUNSW WebCT
Algorithms and Programming Techniques - COMP3121
PRINT THIS PAGE
The Red Centre promenade
 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Course Outline: http://www.cse.unsw.edu.au/
 
 
Campus: Kensington Campus
 
 
Career: Undergraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.125 (more info)
 
 
Contact Hours per Week: 5
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP2011 or COMP2711 or COMP2911.
 
 
Equivalent: COMP3120, COMP3821, COMP9101, COMP9801
 
 
Excluded: COMP3821
 
 
Fee Band: 2 (more info)
 
 
Further Information: See Class Timetable
 
 

Description

Correctness and efficiency of algorithms. Computational complexity: time and space bounds. Techniques for best-case, worst-case and average-case time and space analysis. Designing algorithms using induction, divide-and-conquer and greedy strategies. Algorithms: sorting and order statistics, trees, graphs, matrices. Intractability: classes P, NP, and NP-completeness, approximation algorithms.

Further Information

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.