Credit points: 15

Subject outline

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. You 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. You will also implement in programs a wide range of the structures and algorithms covered.

SchoolEngineering and Mathematical Sciences

Credit points15

Subject Co-ordinatorTian Feng

Available to Study Abroad/Exchange StudentsYes

Subject year levelYear Level 5 - Masters

Available as ElectiveNo

Learning ActivitiesN/A

Capstone subjectNo

Subject particulars

Subject rules

Prerequisites CSE1IOO or CSE4IOO AND Enrolment in one of the following courses: SMIT, SMITCN, SMICT, SMCSC, SMBBS, SGBBS, SGIT or SGCS


Incompatible subjects CSE2ALG AND Students in the following courses are not permitted to enrol: SBCS, SBIT, SBCSGT, SVCSE, SZCSC, SBITP and SBBIY

Equivalent subjectsN/A

Quota Management StrategyN/A

Quota-conditions or rulesN/A

Special conditionsN/A

Minimum credit point requirementN/A

Assumed knowledgeN/A

Career Ready


Work-based learningNo

Self sourced or Uni sourcedN/A

Entire subject or partial subjectN/A

Total hours/days requiredN/A

Location of WBL activity (region)N/A

WBL addtional requirementsN/A

Graduate capabilities & intended learning outcomes

Graduate Capabilities

Intended Learning Outcomes

01. Explain the overall objectives of the field of Algorithms and Data Structures, and the theoretical and experimental techniques for evaluating algorithms and data structures.
02. Distinguish a range of data structures and searching and sorting algorithms in terms of their mechanism, strengths, weaknesses, and conditions appropriate for the related applications.
03. Implement a range of data structures and searching and sorting algorithms in Java, whose programs are of high quality in terms of coding style and comments.
04. Analyse a range of data structures and searching and sorting algorithms in terms of time or space complexity.
05. Analyse a problem, design a solution, implement it in Java, and evaluate its performance using multiple measures.

Subject options

Select to view your study options…

Start date between: and    Key dates

Melbourne (Bundoora), 2021, Semester 1, Day


Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorTian Feng

Class requirements

Laboratory ClassWeek: 11 - 22
One 2.00 h laboratory class per week on weekdays during the day from week 11 to week 22 and delivered via face-to-face.

LectureWeek: 10 - 22
One 2.00 h lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.


Assessment elementCommentsCategoryContributionHurdle% ILO*
Assignment (1750 words equivalent) Assignment will focus on data structures and algorithms - design, implement and evaluate a solutionN/AN/AN/ANo30 SILO2, SILO3, SILO4, SILO5
3 hour written examination (3000 words equivalent) To pass the subject, students also need to satisfy the hurdle requirement for the final examination, i.e. achieve at least 90 marks out of the total 180 marks to pass the examination. The final examination consists of fill-in-blank questions (about complexity analysis, 40 marks), tracing questions (about sorting algorithms, 40 marks) and drawing and analysis questions (about data structures, 100 marks).N/AN/AN/AYes70 SILO1, SILO2, SILO3, SILO5