S Suthaharan
6 points
* 4 hours per week
* First semester
(Gippsland)
* Second semester (Gippsland and distance)
* Prerequisites:
GCO1811
* Corequisites: MAT1077
* Prohibitions: CFR1404, SFT1102
*
Objectives Students completing this subject should be able to implement common abstract data types (ADTs) using data structures such as arrays, linked lists; 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. Data abstraction and data structures; classes and objects. Multi-dimensional arrays, linked lists, stacks, queues, tables, recursion. Access to the university's computer systems via modem is compulsory for distance education students.
Assessment Examination (3 hours): 60%
* Other
assessment modes: 40%
Prescribed texts
To be advised
Back to the Information Technology Handbook, 1998
Published by Monash University, Australia
Maintained by wwwdev@monash.edu.au
Approved by M Rambert, Faculty of Information Technology
Copyright © Monash University 1997 - All Rights Reserved -
Caution