ALGORITHMS AND DATA STRUCTURES

CSE2ALG

2015

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

Available to Study Abroad StudentsYes

Subject year levelYear Level 2 - UG

Exchange StudentsYes

Subject particulars

Subject rules

Prerequisites CSE1OOF

Co-requisitesN/A

Incompatible subjects Any students enrolled in any Graduate Diploma or Masters by Coursework course.

Equivalent subjectsN/A

Special conditionsN/A

Learning resources

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).
Related graduate capabilities and elements:
Discipline-specific GCs(Discipline-specific GCs)
Quantitative Literacy/ Numeracy(Quantitative Literacy/ Numeracy)
Critical Thinking(Critical Thinking)
Writing(Writing)
Inquiry/ Research(Inquiry/ Research)

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
Related graduate capabilities and elements:
Discipline-specific GCs(Discipline-specific GCs)
Critical Thinking(Critical Thinking)
Inquiry/ Research(Inquiry/ Research)
Quantitative Literacy/ Numeracy(Quantitative Literacy/ Numeracy)

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

Activities:
Lectures and labs
Related graduate capabilities and elements:
Creative Problem-solving(Creative Problem-solving)
Inquiry/ Research(Inquiry/ Research)
Discipline-specific GCs(Discipline-specific GCs)
Quantitative Literacy/ Numeracy(Quantitative Literacy/ Numeracy)
Critical Thinking(Critical Thinking)

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

Activities:
Lectures and labs
Related graduate capabilities and elements:
Critical Thinking(Critical Thinking)
Discipline-specific GCs(Discipline-specific GCs)
Creative Problem-solving(Creative Problem-solving)
Quantitative Literacy/ Numeracy(Quantitative Literacy/ Numeracy)

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
Related graduate capabilities and elements:
Creative Problem-solving(Creative Problem-solving)
Critical Thinking(Critical Thinking)
Inquiry/ Research(Inquiry/ Research)
Quantitative Literacy/ Numeracy(Quantitative Literacy/ Numeracy)
Discipline-specific GCs(Discipline-specific GCs)
Writing(Writing)

Subject options

Select to view your study options…

Start date between: and    Key dates

Dandenong, 2015, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorKinh Nguyen

Class requirements

Computer LaboratoryWeek: 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.

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

Assessments

AssignmentHurdle requirement: In order to pass the subject, students must obtain an overall pass grade, pass the examination, pass the assignment component, and attend at least 70% of the laboratory classes.3002, 03, 04, 05
One 3-hour examination7001, 02, 03, 05

Melbourne, 2015, Semester 1, Day

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorKinh Nguyen

Class requirements

LectureWeek: 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 LaboratoryWeek: 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.