Study guide

15.1 Hardware Components and the Fetch–Decode–Execute Cycle

Praxis Computer Science 5652

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode

1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy

2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects

2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations

3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security

3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage

4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation

4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing

5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization

5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range

6 Chapter 6: Algorithms: Searching, Sorting, and Recursion

6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents

7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions

7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra

8 Chapter 8: Programming: Selection, Iteration, and Writing Code

8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code

9 Chapter 9: Programming: Procedures, Arrays, and Data Structures

9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)

10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality

10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback

11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs

11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs

12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design

12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding

13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption

13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs

14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection

14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing

15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments

15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored

16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity

16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs

15.1 Hardware Components and the Fetch–Decode–Execute Cycle

Key Takeaways Explain This Topic AI

The CPU contains the control unit, which directs operations; the arithmetic logic unit (ALU), which computes; and registers, which hold data and addresses being used right now.

Fetch: the address in the program counter is used to read the next instruction from memory into the instruction register, and the program counter advances.

Decode: the control unit interprets the instruction's operation code and operands; execute: the operation is carried out and results are stored, then the cycle repeats.

RAM is volatile main memory for running programs and data; storage such as SSDs and hard drives is nonvolatile and keeps data when power is off.

Faster memory is smaller and costlier per byte: registers, then cache, then RAM, then SSD, then hard disk.

Last updated: September 2026

What this competency asks

Two competencies in Category V cover hardware:

Operating systems control and coordinate hardware and software. The first skill listed is to identify hardware components and their functions (software and operating-system tasks are in Section 15.2).

Be familiar with the steps required to execute a computer program (fetch-decode-execute cycles) : describe what happens during fetch, decode, and execute, including the order of the steps.

Hardware components and their functions

  • Component Function
  • CPU (central processing unit) Executes program instructions
  • — Control unit (CU) Fetches and decodes instructions; directs other components with control signals
  • — Arithmetic logic unit (ALU) Performs arithmetic (add, subtract) and logic (AND, OR, comparisons)
  • — Registers Tiny, very fast storage inside the CPU for the values in immediate use
  • — Cache Small, fast memory on or near the CPU holding recently used data and instructions
  • RAM (main memory) Holds running programs and their data; volatile , so its contents are lost when power is off
  • ROM / firmware Nonvolatile memory holding startup code (BIOS/UEFI)
  • Secondary storage : SSD, hard disk (HDD) Nonvolatile , long-term storage for files and programs
  • Motherboard and buses Connect the components; the address, data, and control buses carry signals
  • GPU (graphics processing unit) Many simple cores for graphics and parallel computation
  • Input devices Keyboard, mouse, touchscreen, microphone, camera, sensors
  • Output devices Display, speakers, printer, actuators
  • Network interface Connects to wired or wireless networks
  • Power supply Converts and delivers electrical power
  • The stored-program idea

In the von Neumann architecture , described in 1945, program instructions and data are both stored as binary in the same memory . The CPU reads instructions from memory just as it reads data. This makes computers general-purpose: loading a different program makes the same hardware do a different job. Because instructions and data share one path to memory, the CPU can wait on memory transfers, a limit known as the von Neumann bottleneck . Caches help reduce it.

Key CPU registers

  • Register Holds
  • Program counter (PC) The address of the next instruction
  • Instruction register (IR) The instruction currently being decoded or executed
  • Memory address register (MAR) The address being read or written
  • Memory data register (MDR) The data just read, or about to be written
  • Accumulator / general-purpose registers Operands and results of ALU operations
  • The fetch–decode–execute cycle

The CPU repeats three steps for every instruction, billions of times per second.

Fetch

Copy the PC's address into the MAR.

Read the instruction at that address from memory into the MDR, then copy it into the IR.

Increment the PC so it points to the next instruction.

Decode

The control unit interprets the instruction: its operation code (for example ADD, LOAD, STORE, or JUMP) and its operands (registers, a value, or a memory address).

It sets up the signals and paths needed to carry out the operation.

Execute

Carry out the operation: the ALU computes, data move between memory and registers, or, for a jump or branch, a new address is written into the PC .

Store the result (some descriptions list this as a fourth store or write-back step).

Repeat with the instruction the PC now points to.

Order matters: fetch, then decode, then execute. A jump works by changing the PC during execute, so the next fetch comes from the new address. That is how loops and if statements are carried out at the hardware level.

Clock speed (in GHz) sets how many cycles per second the processor runs. Real performance also depends on how many instructions complete per cycle, on caches, and on the number of cores , which are independent processing units that can run instructions in parallel. Pipelining overlaps the fetch, decode, and execute stages of consecutive instructions, like an assembly line.

Memory hierarchy

Level Typical size Speed Volatile?

  • Registers Bytes Fastest Yes
  • Cache (L1, L2, L3) KB to tens of MB Very fast Yes
  • RAM GB Fast Yes
  • SSD (flash) Hundreds of GB to TB Much slower than RAM No
  • Hard disk (magnetic) TB Slower still, with mechanical delay No

Faster memory costs more per byte, so computers use small amounts of fast memory and large amounts of slow memory. Caches exploit locality : programs tend to reuse recent data (temporal locality) and access nearby addresses (spatial locality).

Addressable memory

An address bus with n lines can name 2ⁿ addresses. With byte addressing, a 32-bit address space reaches 2³² bytes = 4 GiB , which is why 32-bit systems cannot directly address more than 4 GB of RAM.

Resource issues that affect functionality

Too little RAM forces the operating system to move data to and from storage constantly, which makes the computer slow. A full disk prevents saving files and updates. An overheating CPU slows itself down. Insufficient bandwidth stalls network applications. Section 15.2 connects these hardware limits to operating-system management.