Computer science 1
B T Harding
3 points * 19.5 lecture hours, 19.5 practical/tutorial hours * First semester * Caulfield
Objectives To develop an understanding of the digital computer and a working knowledge of digital logic circuits.
Synopsis The historical development of the stored program computer. Digital and analogue systems. Analogue and digital data, number systems, conversions, codes, use of parity. Binary logic, truth tables, basic gates and their equivalent forms, Boolean algebra and theorems, forms of specification of logic requirements. Karnaugh maps in design, minimization, two-level logic forms. Sequential circuits: flip-flops, state machines, state tables, state diagrams. Standard packages: counters, shift registers, multiplexers, programmable logic arrays (PLAs), etc.
Assessment Examination (3 hours): 80% * Practical work and laboratory work: 20%
Preliminary reading
Hoffman P Archimedes' revenge: The joys and perils of mathematics Penguin, 1988
Recommended texts
Hayes J P Introduction to digital logic design Addison-Wesley, 1993
Tocci R J Digital systems: Principles and applications 6th edn, Prentice-Hall, 1995
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |