Return to previous page

SIT221 - Data Structures and Algorithms

Unit details

Year2016 unit information
Enrolment modes:Trimester 2: Burwood (Melbourne), Waurn Ponds (Geelong), Cloud (online)
Credit point(s):1
EFTSL value:0.125
Unit chair:

Justin Rough

Prerequisite:

SIT131 or SIT232

Corequisite:

Nil

Incompatible with:

Nil

Contact hours:

Campus: 2 x 1 hour class per week, 1 x 2 hour practical per week.

Cloud (online): Learning experiences are via CloudDeakin. Students will have the opportunity to participate in online consultation sessions.

Content

This unit extends the concepts introduced during the prerequisite unit. It extends the study of object-oriented programming by introducing the major data structures used in programming - stacks and queues, collections (sets, bags, lists, trees, hash tables and graphs), and a review of data structures and algorithms provided by system libraries. Other topics include developing algorithms, algorithm optimisation, and recursion, searching and sorting. Upon completion of this unit, students will have an understanding of classes, libraries and algorithms and their role in software development, and be able to implement them.

Assessment

Examination 60%, two assignments (15% each) 30%, weekly practical tasks 10%

Unit Fee Information

All Commonwealth Supported Place (CSP), fee paying undergraduate and pre-2016 commencing students

Unit fee information available soon


2016 commencing International and full fee paying postgraduate domestic students

Your units are priced based on the course you are enrolled in. Please refer to the current year's course entry to estimate the unit cost.


You can calculate the cost of each unit by using the following calculation:


Course fee x unit EFTSL value = unit price

Return to previous page