SIT221 - Data Structures and Algorithms
|Year||2015 unit information|
|Enrolment modes:||Trimester 2: Burwood (Melbourne), Waurn Ponds (Geelong), Cloud (online)|
SIT131 or SIT232
2 x 1 hour class per week, 1 x 2 hour practical per week
Note:You will need to access substantial learning resources and experiences in CloudDeakin (Deakin’s online learning environment). Compliance with the Standards in computing, connectivity and student capability are a condition on your enrolment.
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.
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|
* 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.