Algorithms and Data Structures
Enrolments for this year have closed. Keep exploring subjects.
Subjects may require attendance
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.
Explore La Trobe courses.
QS Ranking 2023
Times Higher Education Ranking 2023
Our student advisors are here to guide you with:
- Enrolling and eligibility
- Fee and loan information
- Credit and recognition for prior learning
- 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.
You must have successfully completed the following subject(s) before starting this subject:
Past La Trobe University students who have previously completed CSE1IOX (Intermediate Object-Oriented Programming) are ineligible to enrol in this subject.
No additional requirements
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).