Mr J G K Harris
6 points
* 4 hours per week
* Gippsland
First/second semester
* Distance second semester
* Prerequisites:
GCO1811
* Corequisites: GAS1614
* Prohibitions: CFR1404, SFT1102
*
Note: Credit towards BAppSc will be given for only one of the subjects GCO1812,
GAS7222 (offered pre-1992)
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; 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, 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%
Prescribed texts
Deitel H M and Deitel P J C++ How to program Prentice-Hall, 1994
Back to the Science Handbook, 1998
Published by Monash University, Australia
Maintained by wwwdev@monash.edu.au
Approved by P Rodan, Faculty of Science
Copyright © Monash University 1997 - All Rights Reserved -
Caution