The University of Western Australia
School of Computer Science and Software Engineering
 
 

School of Computer Science and Software Engineering

CITS2200 Data Structures and Algorithms

Lectures: This unit consists of 24 lectures covering common data structures, algorithms that use these data structures and techniques to analyse the performance of the data structures. Recordings of lectures may be available through the LMS, but attendance at lectures is recommended.The lectures will be held at the Social Sciences Lecture Theatre (Monday 9-10am), and at the Tattersal Lecture Theatre (Wednesday 12-1). The tutorial will be held in Tattersal and Wilsmore Lecture Theatre (Wednesday 1-2). The lecture recordings will be available within half an hour after the completion of the lectures.

Tutorials: A tutorial class will be held every week in Tattersal and Wilsmore Lecture Theatre (Wednesday 1-2) (starting from the second week). The Tutorials are not assessed but are important for following the materials in the lectures and labs.

Laboratories: There will be weekly laboratories that students are expected to work through. These may be done independently in your own time or at the scheduled laboratory if you require guidance. These laboratories will be assessed by an automated marker and contribute 20% of your final mark. The labs will start on Monday, March 6.

Schedule The table below contains links to all required course material. These may be updated as the semester progresses.

Week BeginningLecture
Mon 9-10am; Social Sciences LT;
Lecture
Wed 12-1pm; Tattersal and Wilsmore LT;
Tutorial
Wed 1-2pm; Tattersal and WilsmoreLT
Laboratory
Various
1
February 27 Intro to Algorithms Intro to Data Structures Java Primer I Java Tutorial (Self study) 0 Getting Started with labs
2
March 6 Data Abstraction Queues Lab 1 1 Sorting
3
March 13 Lists Complexity Lab2 2 Stacks
4
March 20 Asymptotic Analysis Amortised Analysis Lab3 3 Queues
5
March 27 Iterators Trees Lab4 4 Lists
6
April 3 Tree Representations Trees and Traversals Lab5 5 Binary Tree
Midsemester break
7
April 17 Priority Queues Minimum Spanning Trees Lab6 6 Tree Search
8
April 24 Shortest Path Algorithms Shortest path algorithms Lab7 7 Priority Queues
9
May 1 All pairs shortest path algorithms (dynamic programming) All pairs shortest path algorithms (dynamic programming) Lab7 8 Priority First Search
10
May 8 Maps Sets and Tables Lab8 Project Lab
11
May 15 Search Trees Hashmaps Project tutorial Project Lab
12
May 22 Revision Exam preparation Project tutorial Project Lab

Laboratory Files CITS2200 package, Documentation

Project 2023

This Page