Data Structures Essentials

Course aim

To develop skills in selecting and implementing appropriate data structures and algorithms to solve problems.

Course content

Introduction to Java; Java API; development environment; collection classes; recursion;
asynchronous programming (File/Net IO/Event handling); use of basic data structures: stacks, queues, deques, vectors and lists, binary trees, balanced trees; and graphs using collections; implementation of one basic data structure; and fundamental algorithms (searching, sorting).

Textbook(s)

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

Prerequisite(s)

Corequisite(s)

Nil

Teaching method

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

Assessment

Continuous assessment, Programming exercise, Test

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.