ALGORITHMS AND DATA STRUCTURES

CSE2ALG

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. 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.

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 2 - UG

Exchange Students: No

Available as Elective: No

Learning Activities: N/A

Capstone subject: No

Subject particulars

Subject rules

Prerequisites: CSE1OOF

Co-requisites: N/A

Incompatible subjects: N/A

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

Learning resources

Data Structures using Java

Resource Type: Book

Resource Requirement: Prescribed

Author: BENDIGO: Malik, DS

Year: N/A

Edition/Volume: 3RD EDN

Publisher: THOMAS NELSON AUST.

ISBN: N/A

Chapter/article title: N/A

Chapter/issue: N/A

URL: N/A

Other description: N/A

Source location: 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

02. Identify a range of data structures and searching and sorting algorithms in the context of computing.

03. Implement a range of data structures and searching and sorting algorithms in Java.

04. Compare a range of data structures and searching and sorting algorithms and apply a suitable one to solving a problem.

05. Design a solution for a problem, implement it in Java, and evaluate its performance using an appropriate measure.

Melbourne (Bundoora), 2020, Semester 1, Day

Overview

Online enrolment: Yes

Maximum enrolment size: N/A

Enrolment information: N/A

Subject Instance Co-ordinator: Tian Feng

Class requirements

Computer LaboratoryWeek: 11 - 22
One 2.00 hours computer laboratory 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 element	Comments	Category	Contribution	Hurdle	%	ILO*
Assignment (1,500-word equivalent)Assignment will focus on data structures and algorithms - design, implement and evaluate a solution.	N/A	N/A	N/A	No	30	SILO2, SILO3, SILO4, SILO5
3-hour final examination (3,000-word equiv)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/A	N/A	N/A	Yes	70	SILO1, SILO2, SILO3, SILO5

Chisholm 311 (Chisholm Institute), 2020, Semester 1, Day