|
Offerings View how this subject is offered in 2003 Home Page  CP2001 Note: The links above will take you away from the official University Handbook. Responsibilty for the accuracy and completeness of information on the subject home pages lies with the pages' School or Faculty maintainer. Some material on subject home pages may be password protected. If the link above is broken or incorrect, please inform Webmanager. |
CP2001:03
Data Structures and Algorithms
| Townsville, Cairns | HECS Band 2 |
39 hours lectures, 13 hours tutorials, 26 hours practicals. Semester 1.
An introduction to the fundamental data structures and their associated algorithms. Major topics covered are: bags, lists, stacks, queues, priority queues, hashing, searching, sorting, traversal. In addition, program specification, design and analysis are stressed.
Learning Objectives:
- understand how ADT implementations are constructed in C++;
- understand how common data structures and algorithms work;
- comprehend the appropriate application of algorithms;
- be able to evaluate and compare algorithms.
Assessment in this subject involves significant on-course assessment including assignments and tests and an examination at the end of the semester. The full details of the assessment are handed out to students in the class in the first week of the semester in which the subject is offered and posted on the Web.