SIT221 - Classes, Libraries and Algorithms
Unit details
Note:
You are seeing the 2009 view of this unit information. These details may
no longer be current.
[Go to the current version]
| Enrolment modes: | (B, G, X) |
|---|
| EFTSL value: | 0.125 |
|---|
| Unit chair: | J Rough |
|---|
| Prerequisite: | SIT131 and two SIT coded units (excluding mathematics units coded SIT19-, SIT29-, SIT39-) or SIT131 and one SIT coded unit and MSC228 (excluding mathematics units coded SIT19-, SIT29-, SIT39-) |
|---|
| Contact hours: | 2 x 1 hour lectures, 1 x 2 hour practical per week |
|---|
Note: Online teaching methods require internet access. Please refer to the most current computer specifications. |
Content
This unit extends the concepts introduced during the prerequisite unit SIT131. 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%, four assignments (10% each) 40%
Unit Fee Information
Please visit
fees and invoices.
