Algorithms and Data Structures
UndergraduateLTU-CSE2ALG2023
Course information for 2023 intake View information for 2025 course intake
Enrolments for this course are closed, but you may have other options to start studying now. Book a consultation to learn more.
- Study method
- 100% online
- Assessments
- Subject may require attendance
- Entry requirements
- Part of a degree
- Duration
- 12 weeks
- Loan available
- HECS-HELP and FEE-HELP available
Algorithms and Data Structures
About this subject
- Explain the overall objectives of the field of Algorithms and Data Structures.
- Identify a range of data structures and searching and sorting algorithms in the context of computing.
- Implement a range of data structures and searching and sorting algorithms in Java.
- Compare a range of data structures and searching and sorting algorithms and apply a suitable one to solving a problem.
- Design a solution for a problem, implement it in Java, and evaluate its performance using an appropriate measure.
- • Complexity analysis.
- • Sorting algorithms.
- • Binary search trees.
- • AVL trees.
- • Hash tables.
- • B-Trees.
- • Heaps.
- • Graphs.
This subject covers a range of important algorithms and data structures. Data structures for implementing containers are covered and include linear structures, tree structures and hash tables. Algorithms for insertion and deletion of elements, and algorithms for searching and sorting on these structures are covered where appropriate. Graphs and graph algorithms are also covered. Students will learn the construction and workings of the data structures and algorithms covered. They will learn to analyse the effectiveness of each data structure and algorithm for specific problems and categories of problems. Students will also implement in programs a wide range of the structures and algorithms covered.
- Assignment (1500-word equivalent) Assignment will focus on data structures and algorithms - design, implement and evaluate a solution. (30%)
- 4 quizzes (1000-word equivalent) (20%)
- 2-hour final examination (2,000-word equiv.) (50%)
For textbook details check your university's handbook, website or learning management system (LMS).
The third university established in Victoria, La Trobe University has a diverse community of more than 38,000 students and staff. Its commitment to excellence in teaching and research prepares students to make a bold and positive impact in today's global community. La Trobe provides Open Universities Australia with its core tenets, entrepreneurship and sustainability.
Learn more about La Trobe University.
Explore La Trobe courses.
- QS World University Ranking 2025, within Australia:
- 17
- Times Higher Education World University Ranking 2025, within Australia:
- 15
Entry requirements
Part of a degree
To enrol in this subject you must be accepted into one of the following degrees:
Elective
- LAT-TEC-DEG-2023 - Bachelor of Information Technology
Prior study
You must have successfully completed the following subject(s) before starting this subject:
Others
Past La Trobe University students who have previously completed CSE1IOX (Intermediate Object-Oriented Programming) are ineligible to enrol in this subject.
Additional requirements
No additional requirements
Study load
- 0.125 EFTSL
- This is in the range of 10 to 12 hours of study each week.
Equivalent full time study load (EFTSL) is one way to calculate your study load. One (1.0) EFTSL is equivalent to a full-time study load for one year.
Find out more information on Commonwealth Loans to understand what this means to your eligibility for financial support.
Related degrees
Once you’ve completed this subject it can be credited towards one of the following courses
Bachelor of Information Technology
UndergraduateLAT-TEC-DEG