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.

SchoolEngineering and Mathematical Sciences

Credit points15

Subject Co-ordinatorTian Feng

Available to Study Abroad/Exchange StudentsYes

Subject year levelYear Level 2 - UG

Available as ElectiveNo

Learning ActivitiesN/A

Capstone subjectNo

Subject particulars

Subject rules

PrerequisitesCSE1OOF

Co-requisitesN/A

Incompatible subjectsN/A

Equivalent subjectsN/A

Quota Management StrategyN/A

Quota-conditions or rulesN/A

Special conditionsN/A

Minimum credit point requirementN/A

Assumed knowledgeN/A

Readings

Data Structures using Java

Resource TypePrescribed

Resource RequirementN/A

AuthorBENDIGO: Malik, DS

YearN/A

Edition/Volume3RD EDN

PublisherTHOMAS NELSON AUST.

ISBNN/A

Chapter/article titleN/A

Chapter/issueN/A

URLN/A

Other descriptionN/A

Source locationN/A

Career Ready

Career-focusedNo

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

Subject options

Select to view your study options…

Start date between: and    Key dates

Melbourne (Bundoora), 2020, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorTian Feng

Class requirements

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

Lecture Week: 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.

Assessments

Assessment elementCommentsCategoryContributionHurdle% ILO*

Assignment (1,500-word equivalent)Assignment will focus on data structures and algorithms - design, implement and evaluate a solution.

N/AN/AN/ANo30 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/AN/AN/AYes70 SILO1, SILO2, SILO3, SILO5

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

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorTian Feng

Class requirements

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

Lecture Week: 10 - 22
Two 1.00 h 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 (1,500-word equivalent)Assignment will focus on data structures and algorithms - design, implement and evaluate a solution.

N/AN/AN/ANo30 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/AN/AN/AYes70 SILO1, SILO2, SILO3, SILO5