Skip to content

Preface

Who this book is for, how it follows the course, and how to use it

This book follows an introductory university course in computer system architecture, taught in the first semester of a computer science degree. It starts from a logic gate and ends at a processor talking to memory and to input-output devices, and it tries to keep one thread running through the whole journey: every component that appears late in the book is assembled from parts that were built earlier. The adder of Chapter 4 reappears inside the arithmetic unit of the basic computer; the flip-flop of Chapter 3 becomes the register of Chapter 6, and then the program counter and accumulator of Chapter 9; the decoder of Chapter 5 becomes the instruction decoder and the address decoder of the memory system.

The text is written for a student who has finished school mathematics and has never opened a computer. No electronics is assumed. What is assumed is willingness to work with small tables of zeros and ones, and to follow a procedure one step at a time. The prerequisite for the course is nothing more than that.

How the book maps to the course

The course has six units totalling 45 hours. Each unit is one or more chapters here.

Unit Course hours Chapters
1. Digital Logic Circuits 6 1. Logic Gates and Boolean Algebra; 2. Karnaugh Maps and Minimisation; 3. Sequential Circuits and Flip-Flops
2. Digital Components 9 4. Adders, Subtractors and Code Converters; 5. Decoders, Encoders and Multiplexers; 6. Registers, Shift Registers and Memory
3. Data Representation and Arithmetic 6 7. Number Systems and Complements; 8. Signed Numbers, Floating Point and Binary Codes
4. Basic Computer Organization and Design 9 9. The Basic Computer: Registers, Bus and Instruction Codes; 10. Timing, Control and the Instruction Cycle; 11. Register-Reference, Input-Output and Interrupts; 12. The Complete Computer and Control Unit Design; 13. Instruction Pipelining
5. Processors 6 14. General Register Organization and Stacks; 15. Addressing Modes and the Instruction Set; 16. RISC and CISC; 17. Multicore Processors and GPUs
6. Memory and Input-Output Organization 9 18. Memory Hierarchy, Main Memory and Auxiliary Memory; 19. Cache Memory and Virtual Memory; 20. Input-Output Interface and Modes of Transfer; 21. Direct Memory Access and I/O Processors

The course text is M. Morris Mano, Computer System Architecture (3rd edition); the references named by the course are listed under Further Reading at the end of the book. This book is a self-contained account of the same topics, in the order in which the units teach them.

How a chapter is built

Every chapter opens by saying what it covers and why it matters, and then proceeds in numbered sections. Three kinds of box recur.

  • Worked examples show every step of a problem, from the statement to the final answer. Read the problem, cover the working, try it yourself, and only then compare.
  • Definitions and cautions pick out the precise statements you must be able to reproduce, and the slips that students most often make.
  • Answers to the exercises at the end of each chapter are folded away. Open one only after you have an answer of your own.

Each chapter closes with a Summary of the key points, often with a compact table to revise from, and with Exercises: short conceptual questions, numerical problems, true-or-false items with reasons, and design problems, every one with an answer. Quick-reference tables for all six units are gathered at the end of the book, followed by a glossary and a short list of further reading.

A word on method

Computer architecture is learned by doing. In the first three units that means filling in truth tables, drawing maps and converting numbers by hand. From the fourth unit onward it means tracing instructions through registers, clock pulse by clock pulse, and the book gives many such traces. Do them with a pencil. Where the text writes a register transfer such as AR ← PC, say aloud what it means: copy the contents of the program counter into the address register. A student who can narrate a trace of the instruction cycle without looking at the page has understood the basic computer.

Notation follows the course: a prime denotes complement (A'), a plus sign in a Boolean expression is OR, a dot or juxtaposition is AND, and numbers in the basic-computer chapters are hexadecimal unless a subscript says otherwise.