Algorithms and Programming Techniques - COMP3121

Faculty: Faculty of Engineering

School: School of Computer Science and Engineering

Course Outline:

Campus: Sydney

Career: Undergraduate

Units of Credit: 6

EFTSL: 0.12500 (more info)

Indicative Contact Hours per Week: 5

Enrolment Requirements:

Prerequisite: COMP1927 or COMP2521 or a mark of at least 65 in COMP1921

Equivalent: COMP3120, COMP9101

Excluded: COMP3821

CSS Contribution Charge: 2 (more info)

Tuition Fee: See Tuition Fee Schedule

Further Information: See Class Timetable

View course information for previous years.


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.
Computing Logo

Study Levels

UNSW Quick Links