Data Structures and Algorithms - COMPX201 (2020)

This paper introduces programming with data structures using Java. Students learn how to program in Java and become familiar with the design, analysis, and application of commonly used data structures, including stacks, queues, lists, trees, and sets.

Paper Information

Points: 15.0
Prerequisite(s): COMPX102 or COMP104
Internal assessment / examination: 100:0
Restriction(s): COMP203, COMP241, COMPX241

Trimesters and Locations

Occurrence Code When taught Where taught
20A (HAM)A Trimester : 2 Mar 2020 - 28 Jun 2020 Hamilton
20G (HAM)G Teaching period : 9 Nov 2020 - 20 Dec 2020 Hamilton
20X (ZUC)X Teaching period : 28 Sep 2020 - 31 Jan 2021 Zhejiang University City College, Hangzhou China

Timetabled Lectures

The Timetable for 2020 is not available.


Indicative Fees for Data Structures and Algorithms (COMPX201)

Occurrence Domestic International
 Tuition Resource 
20A (HAM) $900 $3824
20G (HAM) $900 $3824
You will be sent an enrolment agreement which will confirm your fees.
Tuition fees shown below are indicative only and may change. There are additional fees and charges related to enrolment - please see the Table of Fees and Charges for more information.

Paper Outlines for Data Structures and Algorithms (COMPX201)

The following paper outlines are available for Data Structures and Algorithms (COMPX201).
If your paper occurrence is not listed contact the Faculty or School office.

Additional Information

Available Subjects:  Computer Graphic Design | Computer Science | Electronic Engineering

Other available years: Data Structures and Algorithms - COMPX201 (2024) , Data Structures and Algorithms - COMPX201 (2023) , Data Structures and Algorithms - COMPX201 (2022) , Data Structures and Algorithms - COMPX201 (2021) , Data Structures and Algorithms - COMPX201 (2019) , Data Structures and Algorithms - COMPX201 (2018)

Paper details current as of : 7 December 2023 9:06am
Indicative fees current as of : 9 December 2023 4:32am

This page has been reformatted for printing.