6 points
* Three 1-hour lectures, one 1-hour tutorial
and one 3-hour laboratory class (3rd hour optional) per week
* First,
second semester
* Clayton
* Prohibitions: CFR1111, CFR1121, CFR1124,
CFR1403, CFR2121, CFR7101, CSC1021, DGS1301, GCO1811, GCO2851, RDT1301,
SFT1101, SFT1111, SFT2121, SFT2202, SFT7600
Objectives On completion of this subject, students should understand how computers work; be able to design, implement and debug simple computer programs using a variety of data structures and algorithms; and be able to use a computer system and tools such as editors and compilers.
Synopsis This subject will introduce a modern structured programming language with reference to a simple machine model. Concepts include solving problems computationally, algorithms, simple Boolean algebra. Topics include: control structures - statements, sequence, selection, iteration; programs - procedures, parameters, recursion; data structures - scalars, arrays, records, strings, files, lists; algorithms - insertion, deletion, merge, search, sorting (of various data structures); numerical computing - number representation, representational and arithmetic errors; software engineering principles - modularity, design, documentation, debugging; systems - sufficient overview of system and system software to enable programming to be practised in a realistic context.
Assessment Examination (3 hours): 60%
* Compulsory
assessed laboratory classes: 30%
* Mid-semester test 10%
Prescribed texts
Deitel H M and Deitel P J C: How to program Prentice-Hall, 1994
Recommended texts
Brookshear J G Computer science: An overview Benjamin Cummings, 1994
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