Accessibility Skip to Global Navigation Skip to Local Navigation Skip to Content Skip to Search Skip to Site Map Menu

COSC201 Algorithms and Data Structures

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
Paper code COSC201
Subject Computer Science
EFTS 0.1500
Points 18 points
Teaching period Not offered in 2021 (On campus)
Domestic Tuition Fees (NZD) $1,092.15
International Tuition Fees (NZD) $5,004.75

^ Top of page

Prerequisite
COMP 160 or COMP 162
Restriction
COSC 242
Recommended Preparation
100 level MATH, STAT or COMO paper, BSNS 112 or FINC 102
Schedule C
Arts and Music, Commerce, Science
Contact

adviser@cs.otago.ac.nz

Teaching staff
TBC
Textbooks

TBA

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

^ Top of page

Timetable

Not offered in 2021

Location
Dunedin
Teaching method
This paper is taught On Campus
Learning management system
Blackboard

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
Paper code COSC201
Subject Computer Science
EFTS 0.1500
Points 18 points
Teaching period Semester 1 (On campus)
Domestic Tuition Fees Tuition Fees for 2022 have not yet been set
International Tuition Fees Tuition Fees for international students are elsewhere on this website.

^ Top of page

Prerequisite
COMP 160 or COMP 162
Restriction
COSC 242
Recommended Preparation
100 level MATH, STAT or COMO paper, BSNS 112 or FINC 102
Schedule C
Arts and Music, Commerce, Science
Contact

adviser@cs.otago.ac.nz

Teaching staff

Professor Michael Albert

Textbooks

None

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

^ Top of page

Timetable

Semester 1

Location
Dunedin
Teaching method
This paper is taught On Campus
Learning management system
Blackboard

Computer Lab

Stream Days Times Weeks
Attend one stream from
A1 Monday 09:00-10:50 9-15, 18-22
A2 Monday 12:00-13:50 9-15, 18-22
A3 Monday 14:00-15:50 9-15, 18-22
AND one stream from
B1 Thursday 09:00-10:50 9-15, 17-22
B2 Thursday 12:00-13:50 9-15, 17-22
B3 Thursday 14:00-15:50 9-15, 17-22

Lecture

Stream Days Times Weeks
Attend
A1 Tuesday 11:00-11:50 9-15, 17-22
Friday 11:00-11:50 9-14, 17-22

Tutorial

Stream Days Times Weeks
Attend
A1 Wednesday 16:00-16:50 9-15, 17-22