Return to previous page

Unit details

SIT221 - Data Structures and Algorithms

Year2015 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:

2 x 1 hour class per week, 1 x 2 hour practical per week

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

Student Contribution Rate*Student Contribution Rate**Fee rate - Domestic Students Fee rate - International students
$1096$1096$2898$3005

* Rate for all CSP students, except for those who commenced Education and Nursing units pre 2010
** Rate for CSP students who commenced Education and Nursing units pre 2010
Please note: Unit fees listed do not apply to Deakin Prime students.

Return to previous page


Back to top