You are here: UNE Home / Course and Unit Catalogue / 2009 / A-Z / COMP282

Year:

COMP282 Data Structures and Algorithms

Updated: 07 May 2009
Credit Points 6
Offering
Responsible Campus Teaching Period Mode of Study
Armidale Semester 1 On line
Armidale Semester 1 On Campus
ISBT Sydney ISBT Semester 1 On Campus
ISBT Sydney ISBT Semester 2 On Campus
ISBT Sydney ISBT Summer On Campus
Online level
  • Level D - Comp/internet essential
  • Level E - Wholly online unit
Intensive School(s) None
Supervised Exam There is a UNE Supervised Examination held at the end of the teaching period in which you are enrolled.
Pre-requisites COMP132 or COMP132A or candidature in GradCertCompSc or GradCertInfoTech or GradDipCompSc or GradDipInfoTech or MCompSc or MInfoSys or MInfoSys(Extended) or MInfoTech or MInfoTech(Extended)
Co-requisites None
Restrictions COMP482 or COMP582
Notes

on-campus online D; off-campus online E; 200- and 300-level COMP units (excluding COMP 286) require a knowledge of, and programming experience with the C or C++ language. Any student who completed COMP 130 prior to 1995 should contact the School of Science and Technology for advice. It is recommended that students enrolled for 200-level and above COMP units have access to an IBM compatible computer running the Linux Operating System.

Combined Units COMP482 - Data Structures and Algorithms
Coordinator(s) Serge Bogeholz (sbogeho2@une.edu.au)
Unit Description

This unit introduces fundamental data structures, their implementation and use in efficient program solving in C++. Theory and implementation aspects are treated. Relations between the choice of structure and of algorithm are emphasised. Topics include: dynamic arrays, linked lists, stacks, queues, trees, graphs, hash tables, sorting and searching, recursive algorithms, and analysis of time complexity. COMP482 is based on COMP282 with additional load consisting of extra questions on an assignment and examination, and extra readings from the textbook- tree traversals, binary trees. COMP482 students are expected to show a greater level of understanding of the trees, binary trees and tree traversal.

Prescribed Material
Mandatory
Text(s):

Note: Students are expected to purchase prescribed material

Data Structures and Other Object Using C++
ISBN: 9780321197160
Main, M. and Savitch, W., Addison Wesley 3rd ed. 2004
Text refers to: Semester 1 and ISBT Semesters 1, 2 and ISBT Summer , On Campus and Online
Disclaimer Unit information may be subject to change prior to commencement of the teaching period.
   

Email to a friend