Advanced Data Structures

Course aim

To develop skills in selecting or designing and implementing appropriate data structures and algorithms to developing software to solve problems. This course aims to be an extended version of Data Structures, with some material covered in greater depth, a greater emphasis placed on the links between the course materials and research, and the assessment set at a higher level.

Course content

Design and implementation of classes using abstraction, inheritance, polymorphism, interfaces, nested classes and generic classes.
The Collection classes revisited.
Advanced file IO: NIO, object serialisation.
Design, implementation and use of basic data structures: Stacks, queues, deques, vectors and lists, binary trees, multi-way trees, balanced trees, B and B+ trees; graphs.
Fundamental algorithms (searching, sorting, hash tables, binary search trees, representing graphs, graph traversals, shortest path, transitive closure, minimum spanning tree, topological sorting, simple numerical algorithms, string and pattern matching).
Algorithm design and use: algorithm design strategies (brute force, greedy, divide and conquer, backtracking, branch and bound, heuristic, stochastic); algorithmic complexity (notation, interpretation, complexity of common algorithms); selecting appropriate data structure and algorithm combinations.

Textbook(s)

Koffman, E.B., Wolfgang, P.A.T. 2010, Data Structures: Abstraction and Design using Java, 2nd, Wiley

Prerequisite(s)

Common to all relevant programs
Subject Area & Catalogue Number	Course Name
COMP 1038	Advanced Programming Fundamentals

Corequisite(s)

Nil

Teaching method

Component	Duration
INTERNAL, MAWSON LAKES
Seminar	2 hours x 13 weeks
Computer Practical	1 hour x 13 weeks
Tutorial	1 hour x 13 weeks
INTERNAL, CITY WEST
Seminar	2 hours x 13 weeks
Computer Practical	1 hour x 13 weeks
Tutorial	1 hour x 13 weeks

Note: These components may or may not be scheduled in every study period. Please refer to the timetable for further details.

Assessment

Assignment 1 -Programming Assignment (Templates), Assignment 2 - Programming Assignment (ADT¿s), Assignment 3 - Programming Assignment (Graphs), Examination

Fees

EFTSL*: 0.125
Commonwealth Supported program (Band 2)
To determine the fee for this course as part of a Commonwealth Supported program, go to:
How to determine your Commonwealth Supported course fee. (Opens new window)

Fee-paying program for domestic and international students
International students and students undertaking this course as part of a postgraduate fee paying program must refer to the relevant program home page to determine the cost for undertaking this course.

Non-award enrolment
Non-award tuition fees are set by the university. To determine the cost of this course, go to:
How to determine the relevant non award tuition fee. (Opens new window)

Not all courses are available on all of the above bases, and students must check to ensure that they are permitted to enrol in a particular course.

* Equivalent Full Time Study Load. Please note: all EFTSL values are published and calculated at ten decimal places. Values are displayed to three decimal places for ease of interpretation.