Postgraduate Courses > Postgrad > Swinburne University of Technology, Melbourne, Australia

Postgrad

> Postgrad
> Postgrad Courses

Print or email this page:

Data Structures and Patterns

Unit Code: HIT8303

Duration

Contact Hours

Campus

Prerequisite

Corequisite

1 Semester or equivalent

48 hours

Hawthorn

HIT6302 Object-Oriented Programming or HIT6037 Software Development in Java or HIT7037 Programming in Java or HIT6052 Software Development 2G

Nil

Credit Points: 12.5 Credit Points

Related Course/s:

Discontinued
This unit has been discontinued and will not be offered from semester 1, 2013.

Aims & Objectives:

Learning Outcomes
Upon completion of this unit, students will have knowledge of, and be able to apply, the following principles of data structure and algorithm design, implementation, and application:

Solve problems using object oriented design and implementation techniques
Interpret the tradeoffs and issues involved in the design, implementation, and application of various data structures with respect to a given problem
Design, implement, and evaluate software solutions using behavioural, creational, and structural software design patterns
Explain the purpose and answer questions about data structures and design patterns that illustrate strengths and weaknesses with respect to resource consumption
Assess the impact of data structures on algorithms
Evaluate algorithm designs and perform best-, average-, and worst-case analysis

Teaching Methods:

Lecture (24 hrs), Tutorial (labs) (24 hrs)

Assessment:

Examination, Tests, Assignments

Content:

Introduction: Basic concepts, Sets, arrays, indexer, and iterators, Asymptotic algorithm analysis
Fundamental Data Structures: Dynamic arrays, Single-linked lists
Data Types and Abstraction: Abstract data types, Design patterns, Pointers, Memory management
Basic Container Types: Stacks, Queues, Ordered lists, Hash tables
Hierarchical Data Types: Trees, Graphs, Tree traversals
Algorithmic Patterns and Problem Solvers: Basics, Performance analysis, Greedy algorithms, Backtracking, Divide-and-Conquer

References:

Bruno R. Preiss: Data Structures and Algorithms with Object-Oriented Design Patterns in C++, Wiley & Son,1998.

Stanley B. Lippman, Josée Lajoie, and Barbara E. Moo: C++ Primer. 4th Edition. Addison Wesley 2005