Computer science 1
B T Harding
5 points * 26 lecture hours, 26 practical/tutorial hours * First semester * Caulfield/Peninsula
The historical development of the stored program computer. Digital and analog systems. Analog 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 specifications of logic requirements, Karnaugh maps, minimisation, two-level logic forms. Sequential circuits: flip-flops, state tables, state diagrams, shift registers, counters. Logic packages: logic families and their characteristics, standard packages, use of data handbooks - concepts of SSI, MSI, LSII etc. Implementation using standard packages such as multiplexers, ROM, PLA, adders etc.
Assessment
Examinations (3 hours): 80% * Practical work/Laboratory work: 20%
Preliminary reading
Hoffman P Archimedes' revenge: The joys and perils of mathematics Penguin, 1988
Recommended texts
Floyd T L Digital fundamentals 4th edn, Merrill, 1990
Tocci R J Digital systems: Principles and applications 5th edn, Prentice-Hall, 1991