Authorised by Academic Registrar, April 1996
Objectives Students completing this subject should be able to implement common abstract data types (ADTs) using data structures such as arrays, linked lists, binary search trees; be able to make effective use of existing ADTs to solve higher level problems; and understand the concept of recursion.
Synopsis Structures, files and dynamic memory allocation using C++. Data abstraction and data structures; classes and objects. Multi-dimensional arrays, linked lists, stacks, queues, tables, trees; recursion. Algorithm analysis: order of magnitude analysis, comparison of sorting algorithms. Access to the university's computer systems via modem is compulsory for distance education students.
Assessment Examination (3 hours): 70% + Other assessment modes: 30%