Students > Your course > Subject search > Past Year Subject Details

ALGORITHMS AND DATA STRUCTURES (PG)

CSE5ALG

2020

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.

School: Engineering and Mathematical Sciences (Pre 2022)

Credit points: 15

Subject Co-ordinator: Tian Feng

Available to Study Abroad/Exchange Students: Yes

Subject year level: Year Level 5 - Masters

Available as Elective: No

Learning Activities: N/A

Capstone subject: No

Subject particulars

Subject rules

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

Co-requisites: N/A

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

Equivalent subjects: N/A

Quota Management Strategy: N/A

Quota-conditions or rules: N/A

Special conditions: N/A

Minimum credit point requirement: N/A

Assumed knowledge: N/A

Career Ready

Career-focused: No

Work-based learning: No

Self sourced or Uni sourced: N/A

Entire subject or partial subject: N/A

Total hours/days required: N/A

Location of WBL activity (region): N/A

WBL addtional requirements: N/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.

Melbourne (Bundoora), 2020, Semester 1, Day

Overview

Online enrolment: Yes

Maximum enrolment size: N/A

Subject Instance Co-ordinator: Tian Feng

Class requirements

Laboratory ClassWeek: 11 - 22
One 2.00 hours 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 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

Assessments

Assessment elementCommentsCategoryContributionHurdle%ILO*

Assignment (1750 words equivalent)Assignment will focus on data structures and algorithms - design, implement and evaluate a solution

N/AN/AN/ANo30SILO2, 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/AYes70SILO1, SILO2, SILO3, SILO5