Skip to Main Content
Catalogue Link
<a href="/ords/r/curriculum/catalogue/home" class="t-Header-logo-link"><span class="apex-logo-text">Handbook</span></a>
Hidden Page Items
New
5
New
HE Unit Template
New
Data Structures and Algorithms
New
ITECH2509 - Data Structures and Algorithms
New
20250200
New
New
New
New
Course
New
Unit
New
New
1.2
New
New
2026-09-10
New
2026-09-10
New
Information Technology
New
New
New
New
Institute of Innovation, Science & Sustainability
New
Information Technology
New
Undergraduate
New
15
New
New
.125
New
020109
New
Algorithms
New
020109 - Algorithms
New
<a href="http://www.federation.edu.au/locate/unit/itech2509">View unit fees</a>
New
Graded (e.g. HD, D, C, etc)
New
7
New
Bachelor Degree
New
Intermediate
New
New
New
New
1
New
New
New
New
New
false
New
New
New
<p>This unit will explore program design approaches ensuring efficient computing to solve complex problems. In particular, students will study methods for analysing algorithms` time and space efficiency using asymptotic notation. Students will apply this analysis as they study a range of data structures and the algorithms used for processing such structures. Algorithms covered will include standard sorting and searching methods through to tree, graph and flow network processing algorithms. Finally, this unit will discuss implementation of each approach from scratch, as well as through the use of a built-in Application Programming Interface (API). Upon completion of this unit students will be able to determine and implement the appropriate data structure and algorithm to solve a range of problems, as well as be able to determine the efficiency of the solution.</p>
New
New
<p>Topics may include:<br>
1. <br>
Efficiency of algorithms, time and space complexity.<br><br>
2. <br>
Computational complexity of problems.<br><br>
3. <br>
Range of data structures.<br><br>
4. <br>
Sorting and searching algorithms.<br><br>
5. <br>
Tree processing algorithms.<br><br>
6. <br>
Graph theory.<br><br>
7. <br>
Graph processing algorithms.<br><br>
8. <br>
Network-flow algorithms.<br><br>
9. <br>
Implementation issues such as memory management, data types, generics.<br><br>
10. <br>
API based implementations of algorithms.<br><br>
11. <br>
Empirical testing and validation of algorithm implementations.</p>
New
true
New
<p>Where supplementary assessment is available a student must have failed overall in the Unit but gained a final mark of 45 per cent or above, has completed all major assessment tasks (including all sub-components where a task has multiple parts) as specified in the Unit Description and is not eligible for any other form of supplementary assessment.</p>
New
true
Hidden Page Items
Semester
Semester
0200
Year
Year
2027
Current Year
2026
Breadcrumb Positioning
Handbook
ITECH2509 - Data Structures and Algorithms
Pseudo Breadcrumb
ITECH2509 - Data Structures and Algorithms
Breadcrumb Type
Unit
Catalogue Term and Year
Version Text
You are viewing a version for
Semester
Semester 1
Semester 2
Summer Semester
Year
2027
2026
Download PDF
RDS Holder
Overview
Key information
Requisites
Learning outcomes
Assessment
FedTASK
Parent Region
Overview
Unit description
<p>This unit will explore program design approaches ensuring efficient computing to solve complex problems. In particular, students will study methods for analysing algorithms` time and space efficiency using asymptotic notation. Students will apply this analysis as they study a range of data structures and the algorithms used for processing such structures. Algorithms covered will include standard sorting and searching methods through to tree, graph and flow network processing algorithms. Finally, this unit will discuss implementation of each approach from scratch, as well as through the use of a built-in Application Programming Interface (API). Upon completion of this unit students will be able to determine and implement the appropriate data structure and algorithm to solve a range of problems, as well as be able to determine the efficiency of the solution.</p>
Unit content
<p>Topics may include:<br> 1. <br> Efficiency of algorithms, time and space complexity.<br><br> 2. <br> Computational complexity of problems.<br><br> 3. <br> Range of data structures.<br><br> 4. <br> Sorting and searching algorithms.<br><br> 5. <br> Tree processing algorithms.<br><br> 6. <br> Graph theory.<br><br> 7. <br> Graph processing algorithms.<br><br> 8. <br> Network-flow algorithms.<br><br> 9. <br> Implementation issues such as memory management, data types, generics.<br><br> 10. <br> API based implementations of algorithms.<br><br> 11. <br> Empirical testing and validation of algorithm implementations.</p>
Key information
Institute / school:
Institute of Innovation, Science & Sustainability
Discipline:
Information Technology
Study level:
Undergraduate
Credit points:
15
EFTSL:
0.125
Field of education:
020109 - Algorithms
Grade scheme:
Graded (e.g. HD, D, C, etc)
Placement component:
No
Fee information:
<a href="http://www.federation.edu.au/locate/unit/itech2509">View unit fees</a>
Requisites
Prerequisite
<p> must have completed <a href="/ords/r/curriculum/catalogue/course?p6_code=ITECH1400" target="_blank">ITECH1400</a></p>
Corequisite
None
Exclusion
<p> must not have completed 1 of ITECH3218, <a href="/ords/r/curriculum/catalogue/course?p6_code=ITECH3109" target="_blank">ITECH3109</a></p>
Learning outcomes
Learning outcomes
<p>On successful completion of this unit, students are expected to gain the following [K]nowledge, [S]kills and [A]pplication of knowledge & skills</p>
Learning Outcomes
Ref
Outcome
K1
<p>Describe ways in which to measure the efficiency of an algorithm.</p>
K2
<p>Identify the computational complexity of a range of complex problems.</p>
K3
<p>Discuss the purpose and need for abstract data types in the definition of data structures.</p>
K4
<p>Define a range of common data structures along with their appropriate application.</p>
K5
<p>Identify appropriate API classes and calls to solve complex problems</p>
S1
<p>Calculate and compare the efficiency of algorithms.</p>
S2
<p>Specify abstract data types to describe the design of various data structures.</p>
S3
<p>Implement common data structures and algorithms from first principles.</p>
S4
<p>Validate algorithms` performance empirically and compare with their theoretical efficiency.</p>
A1
<p>Develop, debug and test program solutions for given textual, informally written program specifications.</p>
Assessment
Learning Tasks and Assessment
Ref
Learning task
Assessment type
Weighting
Learning outcomes assessed
1
<p>Demonstrate the ability to solve programming problems by implementing recursive/iterative algorithms.</p>
<p>Lab Test(s)</p>
<p>10 - 20%</p>
K1, K2, S1, S3
2
<p>Solve programming problems by modifying and implementing provided algorithms and data structures.</p>
<p>Assignments and/or projects.</p>
<p>50 - 60%</p>
K4, K5, S1, S2, S3, S4, A1
3
<p>Class attendance and exercises, reading of reference material and lecture notes.</p>
<p>Final Examination/Test</p>
<p>20 - 30%</p>
K1, K2, K3, K4, K5, S1, S2, S3, S4
Supplementary assessment available:
Yes
Supplementary assessment information:
<p>Where supplementary assessment is available a student must have failed overall in the Unit but gained a final mark of 45 per cent or above, has completed all major assessment tasks (including all sub-components where a task has multiple parts) as specified in the Unit Description and is not eligible for any other form of supplementary assessment.</p>
FedTASK
FedTASK
Description of FedTASK outcome
Level
FedTASK 1: Interpersonal
The ability to effectively communicate, interact and work with others both individually and in groups.
FedTASK 2: Leadership
The ability to apply professional skills and behaviours in leading others.
FedTASK 3: Critical Thinking and Creativity
The ability to work in complexity and ambiguity using imagination to create new ideas.
<p>Level 2 - Student demonstrates some independence within provided guidelines</p>
FedTASK 4: Digital Literacy
The ability to work fluently across a range of tools and applications to achieve a range of skills.
<p>Level 3 - Student works independently with limited guidance or works within self-determined guidelines appropriate to context</p>
FedTASK 5: Sustainable and Ethical Mindset
The ability to consider and assess the consequences and impact of ideas and actions in enacting ethical and sustainable decisions.
FedTASK
<p>Federation University recognises that students require key transferable employability skills to prepare them for their future workplace and society. FedTASKs (<strong>T</strong>ransferable <strong>A</strong>ttributes <strong>S</strong>kills and <strong>K</strong>nowledge) provide a targeted focus on five key, transferable Attributes, Skills, and Knowledge that are embedded within curriculum, developed gradually towards successful measures and interlinked with cross-discipline and co-operative learning opportunities.</p>
Key information
Institute / school:
Institute of Innovation, Science & Sustainability
Discipline:
Information Technology
Study level:
Undergraduate
Credit points:
15
EFTSL:
0.125
Field of education:
020109 - Algorithms
Grade scheme:
Graded (e.g. HD, D, C, etc)
Placement component:
No
Fee information:
<a href="http://www.federation.edu.au/locate/unit/itech2509">View unit fees</a>
Additional information
Add Info Static Text
Internal reference: ITECH2509 - U1.2