# ALGORITHMS AND DATA STRUCTURES

CSE2ALG

2018

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.

SchoolSchool Engineering&Mathematical Sciences

Credit points15

Subject Co-ordinatorKinh Nguyen

Subject year levelYear Level 2 - UG

Exchange StudentsYes

## Subject particulars

### Subject rules

Co-requisitesN/A

Incompatible subjectsN/A

Equivalent subjectsN/A

Special conditionsN/A

Resource TypeTitleResource RequirementAuthor and YearPublisher
ReadingsData Structures using JavaPrescribedBENDIGO: Malik, DS3RD EDN, THOMAS NELSON AUST.

## Graduate capabilities & intended learning outcomes

01. Explain the overall objectives of the field of Algorithms and Data Structures

Activities:
Lectures and labs (Each lab is generally devoted to one major algorithm or data structure. It consists of a number of short questions, and a progamming question where the algorithm and data structure is aplied to solved a practical problem).

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

Activities:
Lectures and labs

03. Explain each algorithm or structure, implement them in Java, and analyse their efficiency in relation to real-world problems.

Activities:
Lectures and labs

04. Identify, describe and apply the most suitable technique to use, where there are multiple techniques that could be used.

Activities:
Lectures and labs

05. Identify a problem in application domains, and design and implement a solution (in Java) and evaluate its performance.

Activities:
The problem generally involve application domains that require large amounts of data storage and/or processing. Lectures and labs

## Subject options

Select to view your study options…

Start date between: and    Key dates

## Dandenong, 2018, Semester 1, Day

### Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorKinh Nguyen

### Class requirements

Lecture Week: 10 - 22
Two 1.0 hours lecture per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

Computer Laboratory Week: 10 - 22
One 2.0 hours computer laboratory per week on weekdays during the day from week 10 to week 22 and delivered via face-to-face.

### Assessments

Assignment (1,500-word equivalent)30 02, 03, 04, 05
One 3-hour examinationHurdle requirement: To pass the subject, a pass in the examination is mandatory.70 01, 02, 03, 05

## Melbourne, 2018, Semester 1, Day

### Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorKinh Nguyen

### Class requirements

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