COMP482 Data Structures and Algorithms
Updated: 11 August 2009| Credit Points | 6 | |||||||||||||||
| Offering |
|
|||||||||||||||
| Online level |
|
|||||||||||||||
| 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 COMP530 or COMP532 or candidature in a postgraduate award | |||||||||||||||
| Co-requisites | None | |||||||||||||||
| Restrictions | COMP282 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 |
COMP282 - 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 fo 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
| |||||||||||||||
| Disclaimer | Unit information may be subject to change prior to commencement of the teaching period. |