Linked e-resources
Details
Table of Contents
Intro; Preface; Overview; Organisation and Features; Audience; Acknowledgements; Contents; List of Figures; List of Tables; 1 What Is a Computer?; 1.1 Introduction; 1.2 Analog Computers; 1.3 Digital Computers; 1.3.1 Vacuum Tubes; 1.3.2 Transistors; 1.3.3 Integrated Circuits; 1.3.4 Microprocessor S; 1.4 Von Neumann Architecture; 1.5 Hardware and Software; 1.6 Review Questions; 1.7 Summary; 2 Foundations of Computing; 2.1 Introduction; 2.2 Step Reckoner Calculating Machine; 2.3 Binary Numbers; 2.4 The Difference Engine; 2.5 The Analytic Engine-Vision of a Computer.
2.5.1 Applications of Analytic Engine2.6 Boole's Symbolic Logic; 2.6.1 Switching Circuits and Boolean Algebra; 2.7 Application of Symbolic Logic to Digital Computing; 2.8 Review Questions; 2.9 Summary; 3 A Concise History of Computing; 3.1 Introduction; 3.2 Early Digital Computers; 3.2.1 Harvard Mark 1; 3.2.2 Atanasoff-Berry Computer; 3.2.3 ENIAC; 3.2.4 EDVAC; 3.2.5 Bletchley Park and Colossus; 3.2.6 Zuse's Machines; 3.2.7 Z1, Z2 and Z3 Machines; 3.2.8 University of Manchester; 3.2.9 Manchester Mark I; 3.3 Early Commercial Computers; 3.3.1 The SAGE System; 3.3.2 Invention of the Transistor.
3.3.3 Early Transistor Computers3.4 Integrated Circuits; 3.4.1 Invention of Integrated Circuit; 3.4.2 Moore's Law; 3.4.3 Early Integrated Circuit Computers; 3.4.4 Birth of Silicon Valley; 3.5 IBM System 360; 3.5.1 Background to the Development of System/360; 3.6 Minicomputers and Later Mainframes; 3.7 Microprocessor Revolution; 3.7.1 Early Microprocessors; 3.8 Home Computers; 3.8.1 Xerox Alto Personal Computer; 3.8.2 MITS Altair 8800; 3.8.3 Apple I and II Home Computers; 3.8.4 Commodore PET; 3.8.5 Atari 400 and 800; 3.8.6 Commodore 64; 3.8.7 Apple Macintosh; 3.9 The IBM Personal Computer.
3.9.1 Operating System for IBM PC3.10 Review Questions; 3.11 Summary; 4 Overview Mathematics in Computing; 4.1 Introduction; 4.2 Set Theory; 4.2.1 Set Theoretical Operations; 4.2.2 Properties of Set Theoretical Operations; 4.2.3 Russell's Paradox; 4.2.4 Computer Representation of Sets; 4.3 Relations; 4.3.1 Reflexive, Symmetric and Transitive Relations; 4.3.2 Composition of Relations; 4.3.3 Binary Relations; 4.3.4 Applications of Relations to Databases; 4.4 Functions; 4.4.1 Application of Functions to Functional Programming; 4.5 Number Theory; 4.5.1 Elementary Number Theory.
4.6 Automata Theory4.6.1 Finite-State Machines; 4.7 Graph Theory; 4.8 Computability and Decidability; 4.9 Review Questions; 4.10 Summary; 5 Introduction to Algorithms; 5.1 Introduction; 5.2 Early Algorithms; 5.2.1 Greatest Common Divisors (GCD); 5.2.2 Euclid's Greatest Common Divisor Algorithm; 5.2.3 Sieve of Eratosthenes Algorithm; 5.2.4 Early Cipher Algorithms; 5.3 Sorting Algorithms; 5.4 Binary Trees and Graph Theory; 5.5 Modern Cryptographic Algorithms; 5.6 Computational Complexity; 5.7 Review Questions; 5.8 Summary; 6 A Concise Introduction to Logic; 6.1 Introduction.
2.5.1 Applications of Analytic Engine2.6 Boole's Symbolic Logic; 2.6.1 Switching Circuits and Boolean Algebra; 2.7 Application of Symbolic Logic to Digital Computing; 2.8 Review Questions; 2.9 Summary; 3 A Concise History of Computing; 3.1 Introduction; 3.2 Early Digital Computers; 3.2.1 Harvard Mark 1; 3.2.2 Atanasoff-Berry Computer; 3.2.3 ENIAC; 3.2.4 EDVAC; 3.2.5 Bletchley Park and Colossus; 3.2.6 Zuse's Machines; 3.2.7 Z1, Z2 and Z3 Machines; 3.2.8 University of Manchester; 3.2.9 Manchester Mark I; 3.3 Early Commercial Computers; 3.3.1 The SAGE System; 3.3.2 Invention of the Transistor.
3.3.3 Early Transistor Computers3.4 Integrated Circuits; 3.4.1 Invention of Integrated Circuit; 3.4.2 Moore's Law; 3.4.3 Early Integrated Circuit Computers; 3.4.4 Birth of Silicon Valley; 3.5 IBM System 360; 3.5.1 Background to the Development of System/360; 3.6 Minicomputers and Later Mainframes; 3.7 Microprocessor Revolution; 3.7.1 Early Microprocessors; 3.8 Home Computers; 3.8.1 Xerox Alto Personal Computer; 3.8.2 MITS Altair 8800; 3.8.3 Apple I and II Home Computers; 3.8.4 Commodore PET; 3.8.5 Atari 400 and 800; 3.8.6 Commodore 64; 3.8.7 Apple Macintosh; 3.9 The IBM Personal Computer.
3.9.1 Operating System for IBM PC3.10 Review Questions; 3.11 Summary; 4 Overview Mathematics in Computing; 4.1 Introduction; 4.2 Set Theory; 4.2.1 Set Theoretical Operations; 4.2.2 Properties of Set Theoretical Operations; 4.2.3 Russell's Paradox; 4.2.4 Computer Representation of Sets; 4.3 Relations; 4.3.1 Reflexive, Symmetric and Transitive Relations; 4.3.2 Composition of Relations; 4.3.3 Binary Relations; 4.3.4 Applications of Relations to Databases; 4.4 Functions; 4.4.1 Application of Functions to Functional Programming; 4.5 Number Theory; 4.5.1 Elementary Number Theory.
4.6 Automata Theory4.6.1 Finite-State Machines; 4.7 Graph Theory; 4.8 Computability and Decidability; 4.9 Review Questions; 4.10 Summary; 5 Introduction to Algorithms; 5.1 Introduction; 5.2 Early Algorithms; 5.2.1 Greatest Common Divisors (GCD); 5.2.2 Euclid's Greatest Common Divisor Algorithm; 5.2.3 Sieve of Eratosthenes Algorithm; 5.2.4 Early Cipher Algorithms; 5.3 Sorting Algorithms; 5.4 Binary Trees and Graph Theory; 5.5 Modern Cryptographic Algorithms; 5.6 Computational Complexity; 5.7 Review Questions; 5.8 Summary; 6 A Concise Introduction to Logic; 6.1 Introduction.