Due to COVID-19 restrictions, a selection of on-campus papers will be made available via distance and online learning for eligible students.
Find out which papers are available and how to apply on our COVID-19 website
Development and analysis of fundamental algorithms and data structures and their applications including: sorting and searching, dynamic programming, graph and tree algorithms, and string processing algorithms.
|Paper title||Algorithms and Data Structures|
|Teaching period||Semester 1 (On campus)|
|Domestic Tuition Fees (NZD)||$1,110.75|
|International Tuition Fees||Tuition Fees for international students are elsewhere on this website.|
- COMP 160 or COMP 162
- COSC 242
- Recommended Preparation
- 100 level MATH, STAT or COMO paper, BSNS 112 or FINC 102
- Schedule C
- Arts and Music, Commerce, Science
- Teaching staff
- Graduate Attributes Emphasised
- Interdisciplinary perspective, Lifelong learning, Scholarship, Communication, Critical
thinking, Information literacy, Research, Self-motivation, Teamwork.
View more information about Otago's graduate attributes.
- Learning Outcomes
By completion of this paper students are expected to:
- Understand the basic principles of analysing algorithmic complexity including “big-O” and related notation.
- Understand fundamental structural properties of algorithms including: greedy algorithms, dynamic programming, divide and conquer, depth and breadth first search, time-space trade-offs.
- Understand fundamental data structures used in sorting and searching, graph, tree and network representations.
- Demonstrate an ability to apply such algorithms in practical problems including the ability to choose the appropriate algorithm and/or data structure for the context.
- Understand how the computational overheads and scalability of algorithms or data structures affect their suitability in applications.
- Acquire increased proficiency in programming