There is a more recent version of this academic item available.

Overview

This subject covers a range of important algorithms and data structures. Data structures for implementing containers are covered and include linear structures, tree structures and hash tables. Algorithms for insertion and deletion of elements, and algorithms for searching and sorting on these structures are covered where appropriate. Graphs and graph … For more content click the Read more button below.

Portfolio

Office of the Provost

Subject coordinator

Zijing Chen

Subject type

Undergraduate

Year level

Year Level 2 - UG

AQF level

Level 6 - Advanced Diploma

Available as elective

No

Available to study abroad / exchange students

Yes

Capstone subject

No

Academic progress review - Schedule A subject

No

Subject instances

To view instance specific details which include - Assessments, Class requirements and Subject instance coordinators - please select your preferred instance via the drop-down menu at the top right-hand side of this page.

Learning resources

Prescribed - Book - Data Structures using Java

Career ready

Work based learning (placement):No

Graduate capabilities

COMMUNICATION - Digital Capability
DISCIPLINE KNOWLEDGE AND SKILLS
INQUIRY AND ANALYSIS - Creativity and Innovation
INQUIRY AND ANALYSIS - Critical Thinking and Problem Solving

Subject intended learning outcomes

On successful completion you will be able to:
1.
Explain the overall objectives of the field of Algorithms and Data Structures
2.
Identify a range of data structures and searching and sorting algorithms in the context of computing.
3.
Implement a range of data structures and searching and sorting algorithms in Java.
4.
Compare a range of data structures and searching and sorting algorithms and apply a suitable one to solving a problem.
5.
Design a solution for a problem, implement it in Java, and evaluate its performance using an appropriate measure.

Enrolment rules

Special conditions