COMP282 Data Structures and Algorithms
| 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 | COMP 132 or 132A; or candidature in one of the following: GradCertCompSc; GradCertInfoTech; GradDipCompSc;GradDipInfoTech; MCompSc; MInfoSys; MInfoSys(Extended); MInfoTech; MInfoTech(Extended) | |||||||||||||||
| Co-requisites | None | |||||||||||||||
| Restrictions | COMP 582 | |||||||||||||||
| Notes | on-campus online D; off-campus online E; see COMP 280 | |||||||||||||||
| Combined Units |
COMP582 - Data Structures and Algorithms |
|||||||||||||||
| Coordinator(s) |
|
|||||||||||||||
| 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: linked lists, stacks, queues, trees, graphs, hash tables, sorting and searching, recursive algorithms, and analysis of time and space complexity. COMP 582 is based on the undergraduate unit COMP 282 with additional load consisting of extra questions on assignments and examinations and candidates for COMP 582 will be expected to show a greater level of understanding of the unit material than that required for COMP 282. Students who complete COMP 282 are not permitted to enrol for COMP 582. |
|||||||||||||||
| Prescribed Material Mandatory |
Text(s):Note: Students are expected to purchase prescribed material
|
|||||||||||||||
| Recommended Material Optional |
None | |||||||||||||||
| Disclaimer | Unit information may be subject to change prior to commencement of the teaching period. |