book

Introduction to Computer Organization

Name: Introduction to Computer Organization
Author: Robert G. Plantz
ISBN: 9781718500099

by Robert G. Plantz

January 2022

Beginner

502 pages

12h 58m

English

No Starch Press

Read now

Unlock full access

Title Page
Copyright
About the Author
Preface
Who This Book Is ForAbout This BookThe Programming in the BookWhy Read This Book?Chapter OrganizationEfficient Use of This Book
Acknowledgments
Chapter 1: Setting the Stage
Computer SubsystemsProgram ExecutionThe Programming EnvironmentWhat You’ve Learned
Chapter 2: Data Storage Formats
Describing Switches and Groups of SwitchesRepresenting Switches with BitsRepresenting Groups of BitsUsing Hexadecimal DigitsThe Mathematical Equivalence of Binary and DecimalGetting to Know Positional NotationConverting Binary to Unsigned DecimalConverting Unsigned Decimal to BinaryStoring Data in MemoryExpressing Memory Addresses CharactersUnsigned IntegersExploring Data Formats with CC and C++ I/O LibrariesWriting and Executing Your First C ProgramExamining Memory with a DebuggerUsing Your DebuggerUnderstanding Byte Storage Order in MemoryWhat You’ve Learned
Chapter 3: Computer Arithmetic
Adding and Subtracting Unsigned IntegersAdding in the Decimal Number SystemSubtracting in the Decimal Number SystemAdding and Subtracting Unsigned Integers in BinaryAdding and Subtracting Signed IntegersTwo’s ComplementComputing Two’s ComplementAdding and Subtracting Signed Integers in BinaryCircular Nature of Integer CodesWhat You’ve Learned
Chapter 4: Boolean Algebra
Basic Boolean OperatorsBoolean ExpressionsBoolean Algebra RulesBoolean Algebra Rules That Are the Same as Elementary AlgebraBoolean Algebra Rules That Differ from Elementary AlgebraBoolean FunctionsCanonical Sum or Sum of MintermsCanonical Product or Product of MaxtermsComparison of Canonical Boolean FormsBoolean Expression MinimizationMinimal ExpressionsMinimization Using Algebraic ManipulationsMinimization Using Karnaugh MapsCombining Basic Boolean OperatorsWhat You’ve Learned
Chapter 5: Logic Gates
Crash Course in ElectronicsPower Supplies and BatteriesPassive ComponentsTransistorsMOSFET SwitchCMOS SwitchNAND and NOR GatesNAND as a Universal GateWhat You’ve Learned

Chapter 6: Combinational Logic Circuits
The Two Classes of Logic CircuitsAddersHalf AdderFull AdderFull Adder from Two Half AddersRipple-Carry Addition and Subtraction CircuitsDecodersMultiplexersTristate BufferProgrammable Logic DevicesProgrammable Logic Array Read-Only Memory Programmable Array Logic What You’ve Learned
Chapter 7: Sequential Logic Circuits
LatchesSR Latch Using NOR GatesSR Latch Using NAND GatesSR Latch with EnableThe D LatchFlip-FlopsClocksD Flip-FlopT Flip-FlopJK Flip-FlopDesigning Sequential Logic CircuitsDesigning a CounterDesigning a Branch PredictorWhat You’ve Learned
Chapter 8: Memory
The Memory HierarchyMass StorageMain MemoryCache MemoryRegistersImplementing Memory in HardwareFour-Bit RegisterShift RegisterRegister FileRead-Write MemoryStatic Random-Access Memory Dynamic Random-Access Memory What You’ve Learned
Chapter 9: Central Processing Unit
CPU OverviewCPU SubsystemsInstruction Execution Cyclex86-64 RegistersGeneral-Purpose RegistersStatus RegisterC/C++ Integral Data Types and Register SizesUsing gdb to View the CPU RegistersWhat You’ve Learned
Chapter 10: Programming in Assembly Language
Compiling a Program Written in CFrom C to Assembly LanguageAssembler Directives That We Won’t UseAssembler Directives That We Will UseCreating a Program in Assembly LanguageAssembly Language in GeneralFirst Assembly Language InstructionsMinimal Processing in a FunctionUsing gdb to Learn Assembly LanguageAT&T SyntaxWhat You’ve Learned
Chapter 11: Inside the main Function
The write and read System Call FunctionsPassing Arguments in RegistersPosition-Independent CodeThe Call StackStacks in GeneralInside the Function Prologue and EpilogueLocal Variables in a FunctionVariables on the StackStack CorruptionNot Using the C Runtime EnvironmentWhat You’ve Learned
Chapter 12: Instruction Details
Looking at Machine CodeInstruction BytesOpcode BytesModR/M ByteREX Prefix ByteImmediate Addressing ModeMemory Addressing ModesDirect Memory AddressingRegister Indirect with OffsetRegister Indirect with IndexingSIB ByteJump InstructionsAssemblers and LinkersThe AssemblerThe LinkerWhat You’ve Learned
Chapter 13: Control Flow Constructs
JumpsUnconditional JumpsConditional JumpsIterationwhile Loopfor Loopdo-while LoopSelectionif Conditionalif-then-else Conditionalswitch ConditionalWhat You’ve Learned
Chapter 14: Inside Subfunctions
Scope of Variable Names in COverview of Passing ArgumentsGlobal VariablesExplicitly Passing ArgumentsPassing Arguments in CWhat’s Going On in Assembly LanguageHandling More Than Six ArgumentsPushing Arguments onto the StackStoring Arguments Directly on the StackSummary of Stack Frame UsageStatic Local VariablesWhat You’ve Learned
Chapter 15: Special Uses of Subfunctions
RecursionAccessing CPU Features in Assembly LanguageA Separate Function Written in Assembly LanguageInline Assembly LanguageWhat You’ve Learned
Chapter 16: Computing with Bitwise Logic, Multiplication, and Division Instructions
Bit MaskingBit Masking in CLogic InstructionsBit Masking in Assembly LanguageShifting BitsShifting Bits in CShift InstructionsShifting Bits in Assembly LanguageMultiplicationMultiplication in CMultiply InstructionsMultiplication in Assembly LanguageDivisionDivision in CDivision InstructionsDivision in Assembly LanguageWhat You’ve Learned
Chapter 17: Data Structures
ArraysArrays in CArrays in Assembly LanguageRecordsRecords in CRecords in Assembly LanguagePassing Records to Other Functions in CPassing Records to Other Functions in Assembly LanguageWhat You’ve Learned
Chapter 18: Object-Oriented Programming
Objects in C++Using Objects in C++Defining Class Member FunctionsLetting the Compiler Write a Constructor and DestructorObjects in Assembly LanguageWhat You’ve Learned
Chapter 19: Fractional Numbers
Fractional Values in BinaryFixed-Point NumbersWhen the Fractional Part Is a Sum of Inverse Powers of TwoWhen the Fractional Part Is in DecimalFloating-Point NumbersFloating-Point RepresentationIEEE 754 Floating-Point StandardSSE2 Floating-Point Hardwarexmm RegistersProgramming with Floating-Point NumbersFloating-Point Arithmetic ErrorsComments About Numerical AccuracyWhat You’ve Learned
Chapter 20: Input/Output
Timing ConsiderationsMemory TimingI/O Device TimingBus TimingAccessing I/O DevicesPort-Mapped I/OMemory-Mapped I/OI/O ProgrammingPolled I/OInterrupt-Driven I/ODirect Memory AccessPolled I/O Programming AlgorithmsUART Memory-Mapped I/O in CUART Memory-Mapped I/O in Assembly LanguageUART Port-Mapped I/OWhat You’ve Learned
Chapter 21: Interrupts and Exceptions
Privilege LevelsCPU Response to an Interrupt or ExceptionExternal InterruptsExceptionsSoftware InterruptsSystem CallsThe int 0x80 Software InterruptThe syscall InstructionWhat You’ve Learned
Index

Content preview from Introduction to Computer Organization

4 Boolean Algebra

Boolean algebra was developed in the 19th century by an English mathematician, George Boole, who was working on ways to use mathematical rigor to solve logic problems. He formalized a mathematical system for manipulating logical values in which the only possible values for the variables are true and false, usually designated 1 and 0, respectively.

The basic operations in Boolean algebra are conjunction (AND), disjunction (OR), and negation (NOT). This distinguishes it from elementary algebra, which includes the infinite set of real numbers and uses the arithmetic operations addition, subtraction, multiplication, and division. ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9781098130183

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Introduction to Computer Organization

by Robert G. Plantz

4 Boolean Algebra

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.