Program design and data structures
D Hagan
6 points
* 5 hours per week
* First, second semester
* Caulfield
* Prerequisites: SFT1101
* Prohibitions: CFR1124, CFR1404, CFR2121,
CSC1030, CSC1062, GCO1812, RDT1400, SFT2121, SFT2202, TEC2042
Objectives At the completion of this subject, students should be able to design a program using either a procedural or an object-oriented approach; implement that design in an appropriate programming language; and construct and manipulate commonly used data structures.
Synopsis Program design concepts such as encapsulation and abstract data types implemented as classes. Use and implementation of data structures such as stacks, queues, lists, sequential and keyed external files at a physical and abstract level.
Assessment Unit tests: 30%
* Assignments: 30%
* Examination (3
hours): 40%
Prescribed texts
Dale N Weems C and Headington M Programming and problem solving with C++ Heath, 1996
Recommended texts
Friedman F L and Koffman E B Problem solving, abstraction and design using C++ Addison-Wesley, 1994
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |