Please note - Swinburne University of Technology
Please note - Swinburne University of Technology
Please note - Swinburne University of Technology
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
References<br />
Beisler, F. and Scheeres, H. Communication Skills. 2nd Aust. edn,<br />
Melbourne, Longman Cheshire, 1993<br />
Dwyer, J. The Business Communication Handbook. 3rd edn, New<br />
York, Sydney, Prentice Hall, 1993<br />
Nutting, J. and White, G. The Business <strong>of</strong> Communicating. 2nd edn,<br />
New York, McGraw-Hill, 1990<br />
Vallence, K.E. and McWilliam, T. Communication That Works.<br />
Melbourne, Thomas Nelson, 1990<br />
SQI 17<br />
Introduction to Computer Systems<br />
10 credit points<br />
No. <strong>of</strong> hours per week: three hours<br />
Instruction: a combination <strong>of</strong> lectures, tutorials<br />
laboratory sessions and reading assignments<br />
Assessment: assignments and a final<br />
examination, computer managed learning tests<br />
Subject description<br />
History <strong>of</strong> computing machines. Functional components <strong>of</strong> a<br />
computer system. Number systems. Data encoding for<br />
internal and external storage. Computer arithmetic. Boolean<br />
algebra -theorems, truth tables, Karnaugh maps. Circuit<br />
design <strong>of</strong> CPU modules - in particular the ALU. Machine<br />
fetch - execute cycle. Compilation, assembly and machine<br />
language ideas. Operating systems, in particular MS-DOS.<br />
$ Details <strong>of</strong> secondary storage and data transfer.<br />
t?. n<br />
J<br />
o, s~zo4 Formal Methods<br />
g<br />
10 credit points<br />
3<br />
n<br />
No. <strong>of</strong> hours per week: three hours<br />
ID<br />
Instruction: lectures and tutorials<br />
rn<br />
3 Assessment: mid-semester test, assignment and<br />
s.<br />
3 final examination<br />
ID<br />
?. Subject aims<br />
Formal Methods examines the scope, role and application <strong>of</strong><br />
mathematics in contemporary s<strong>of</strong>tware development.<br />
3<br />
a Particular emphasis is placed on the use <strong>of</strong> discrete<br />
u mathematics for formal specification.<br />
After completing 14204, a student will be able to apply the<br />
3<br />
discrete mathematics taught in the course to system<br />
modelling; interpret and construct formal specifications using<br />
the Z formal specification language.<br />
Subject description<br />
lntroduction to formal methods; propositional calculus; pro<strong>of</strong><br />
and argument; set theory; the Z predicate calculus; relations;<br />
functions; sequence; bags; formal specification languages.<br />
Textbooks<br />
D. Lightfoot, Formal Specification Using Z. Basingstoke, Macmillan,<br />
1991<br />
s~zo7<br />
Computer Organistion<br />
10 credit points<br />
No. <strong>of</strong> hours per week: three hours<br />
Instruction: lecture and laboratory sessions<br />
Assessment: assignment and examination<br />
Subject alms<br />
To introduce the main principles <strong>of</strong> computer architecture,<br />
computer organisation and assembly language programming.<br />
Subject description<br />
lntroduction to combinatorial and sequential circuit design;<br />
basic architecture <strong>of</strong> a computer; CPU organisation; execution<br />
<strong>of</strong> machine instructions: how programs interact with the<br />
computer hardware; introduction to assembly language<br />
programming.<br />
Textbooks<br />
To be advised<br />
54210 Programming in C<br />
10 credit points<br />
No. <strong>of</strong> hours per week: four hours<br />
Instruction: a combination <strong>of</strong> lectures and<br />
laboratory exercises<br />
Assessment: programming assignments and a<br />
final examination<br />
Subject aims<br />
To study the programming language C and the related<br />
s<strong>of</strong>tware engineering practice through consideration <strong>of</strong> the<br />
specification, design and implementation <strong>of</strong> algorithms in C.<br />
This will involve an examination <strong>of</strong> C data types and<br />
structures, control statements, functions and formatted 110.<br />
Textbooks<br />
To be advised<br />
s~3oo<br />
Data Structures and Algorithms<br />
10 credit points<br />
No. <strong>of</strong> hours per week: three hours<br />
Prerequisites: SQ100 Programming in Ada<br />
Instruction: lecture and tutorials<br />
Assessment: assignments and examination<br />
A second year subject <strong>of</strong> the degree course in computer<br />
science and s<strong>of</strong>tware engineering.<br />
Subject description<br />
Data Structures and Algorithms: this subject pursues the goal<br />
<strong>of</strong> good programming (correctness, flexibility, adaptability,<br />
portability, utility and clarity) through the concepts <strong>of</strong><br />
modularity and abstract data types.<br />
Syllabus: common data structures, associated algorithms and<br />
applications; stacks, queues, trees, binary search trees,<br />
balancing; heaps, sets; graphs; hash tables; Ada generics.<br />
Textbooks<br />
To be advised