COMP 261Algorithms and Data Structures

Students who pass this course should be able to:

1. Select, adapt, and implement a wide range of standard algorithms and data structures to construct software solutions to complex problems (BE 3(a), 3(d), 3(f), BSc 1, 2).

2. Understand algorithms described in pseudocode and to use analysis of an algorithm's time and space requirements to determine applicability to a problem (BE 3(a), 3(b), BSc 3).

3. Recognise the distinction between "easy" problems, 'hard' (NP) problems, and uncomputable problems and the consequences for constructing algorithms and programs for such problems (BE 3(b), BSc 3,4).

4. Know and be able to implement important algorithms related to graphs, searching, and parsing (BE 3(a), BSc 2).

During the trimester there will be up to three lectures each week, along with a tutorial for which you will need to sign up. While lectures will be offered in-person and recorded for online access, the course is primarily designed for in-person study, and students are strongly encouraged to attend lectures and tutorials on campus. Some assessment items/tasks will require in-person attendance, particularly tests and the marking of the assignments.

Assessment dates and extensions

Once you've signed up to this course, you can use Nuku

The University’s online learning environment

to see due dates for assessments and information about extensions.

Mandatory requirements