Data structures in C
A Cheng
4 points
* 4 hours per week
* First semester
* Caulfield
*
Prerequisites: SFT1122 or equivalent
* Prohibitions: CFR1111, CFR1122,
CFR2121, CSC1030, RDT1400, SFT1101, SFT1102, SFT2121, TEC2041, TEC2042,
TEC2342
Objectives At the completion of this subject students should be reasonably proficient in the use of the C programming language; able to implement common abstract data structures in C; and sufficiently familiar with the UNIX environment to undertake program development in C at any UNIX site.
Synopsis Introduction to the C programming language; introduction to the UNIX operating system; technique for developing reasonably large programs; data abstraction; implementation of data structures using C.
Assessment Unit test: 20%
* Assignments: 40%
* Examination:
40%
Prescribed texts
Kelley A and Pohl I A book on C 3rd edn, Benjamin-Cummings, 1995
Recommended texts
Ammeraal L Programs and data structures in C Wiley, 1990
Glass G UNIX for programmers and users Prentice-Hall, 1993
Hanly J R and others Problem solving and program design in C Addison-Wesley, 1993
Sobell M A practical guide to UNIX System V Benjamin-Cummings, 1984
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |