S Suthaharan and R Sarker
6 points
* 4 hours per week
* First/second
semester, Gippsland
* Second semester, distance
* Prerequisites:
GEG1132
Objectives Students completing this subject should be able to implement common abstract date 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 using C++. Data abstraction and data structures; classes and objects. Multidimensional 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): 70%
* Other
assessment modes: 30%
Prescribed texts
Dietel H M and Dietel P J C++: How to program Prentice-Hall, 1994
Back to the Engineering Handbook, 1998
Published by Monash University, Australia
Maintained by wwwdev@monash.edu.au
Approved by R Chaffey, Faculty of Engineering
Copyright © Monash University 1997 - All Rights Reserved -
Caution