Study guide
15.2 Operating Systems, Software Components, and Resource Issues
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.2 Operating Systems, Software Components, and Resource Issues
Key Takeaways Explain This Topic AI
An operating system manages hardware resources and provides services to applications: it schedules processes, manages memory, organizes files, controls devices through drivers, and enforces security.
System software (the operating system, device drivers, utilities, and language translators) supports the computer, while application software (browsers, word processors, games) performs tasks for users.
When running programs need more memory than the installed RAM, the operating system uses virtual memory on storage; too much swapping (thrashing) makes the system very slow.
A process is a running program; the scheduler shares CPU time among processes, for example in round-robin time slices, so many programs appear to run at once.
Deadlock can occur only when mutual exclusion, hold-and-wait, no preemption, and circular wait all hold, so preventing any one of these conditions prevents it.
Last updated: September 2026
What this competency asks
ETS asks you to know that operating systems are programs that control and coordinate interactions between hardware and software components :
Identify hardware components and their functions (Section 15.1).
Identify software components and their functions.
Identify common operating-system tasks.
Identify resource issues that have an impact on functionality.
Software components
Category Examples Function
Operating system Windows, macOS, Linux, ChromeOS, iOS, Android Manages hardware and provides services to other software
Kernel The core of the operating system Runs with full hardware access; handles processes, memory, and devices
Device drivers Printer, graphics, and network drivers Translate operating-system requests into commands for specific hardware
- Utility programs Backup, antivirus, disk cleanup, compression tools Maintain and protect the system
- Language translators Compilers, interpreters, assemblers Turn source code into runnable form (Section 12.1)
- Firmware BIOS/UEFI Starts the hardware and loads the operating system
- Application software Browsers, office suites, games, learning apps Perform tasks for the user
The first six are system software , which runs and supports the computer. Application software serves the user's goals. Users
- ↓
- Application software (browser, spreadsheet, IDE)
- ↓ system calls
- Operating system (process, memory, file, device, and security management)
- ↓ drivers
- Hardware (CPU, RAM, storage, network, I/O devices)
- Common operating-system tasks
Task What the operating system does Example
Process management Starts and stops programs, shares CPU time, handles multitasking Music keeps playing while you type
Memory management Gives each program its own memory space; provides virtual memory Programs cannot overwrite one another's data
File management Organizes files and folders; controls reading and writing Saving, renaming, and searching for files
Device management Communicates with hardware through drivers; handles interrupts Printing; recognizing a USB drive
Security and access control User accounts, passwords, permissions, and updates Students cannot change system settings
- User interface Command-line or graphical interface Desktop, windows, and menus
- Networking Connects to networks and manages connections Wi-Fi setup
- Error handling and logging Detects and reports errors; keeps logs Crash reports
- Processes and scheduling
A process is a program in execution, with its own memory and state. A thread is a sequence of execution within a process; threads share the process's memory. On a single core, the scheduler switches rapidly between processes ( multitasking ), often in round-robin time slices of a few milliseconds. The switching itself, called a context switch , costs time. On multicore processors, processes and threads can truly run in parallel .
A process moves through states: new → ready → running → (waiting for input or output → ready) → terminated . A running process goes back to ready when its time slice ends.
Memory management and virtual memory
The operating system gives each process the illusion of its own large memory space. With virtual memory , parts of a process's memory that are not currently needed are stored on disk and brought into RAM when they are needed, in fixed-size pages . If running programs together need much more than the installed RAM, the system spends most of its time moving pages between RAM and disk. This is thrashing : the disk is constantly busy while useful CPU work drops sharply.
File systems
A file system organizes storage into files within a hierarchy of folders, tracks where each file's data blocks are, and enforces permissions . Absolute paths start at the root ( /home/lee/notes.txt ), while relative paths start from the current folder ( ../notes.txt ).
Resource issues that affect functionality
- Resource problem Symptom Remedy
- Not enough RAM Slowdown and thrashing when many programs or browser tabs are open Close programs; add RAM
Storage nearly full Cannot save files or install updates; slower performance Delete or archive files; add storage
CPU overloaded Laggy interface; slow processing Close background tasks; faster or more cores
Too little network bandwidth Buffering video; slow downloads Reduce simultaneous use; upgrade the connection (Section 16.3)
- Battery or power limits Mobile devices throttle performance Power-saving settings
- Outdated or missing drivers Devices stop working Install the correct drivers
- Resource contention Programs wait for the same printer, file, or lock Scheduling, queues, and locking
- Deadlock
A deadlock occurs when processes wait on one another forever. For example, process A holds the printer and waits for the scanner, while process B holds the scanner and waits for the printer. Coffman and colleagues (1971) identified four conditions that must all hold for deadlock to occur:
Mutual exclusion: a resource can be used by only one process at a time.
Hold and wait: a process holds one resource while waiting for another.
No preemption: resources cannot be taken away from a process by force.
Circular wait: a cycle of processes, each waiting for the next.
Preventing any one condition prevents deadlock. A common method is to make every process request resources in the same fixed order, which breaks circular wait.
Operating systems on different devices
Desktop operating systems prioritize flexibility and multitasking. Mobile operating systems add strict app permissions , battery management, and touch interfaces. Embedded systems (Section 15.3) often use small real-time operating systems that guarantee responses within fixed time limits, which is essential for devices such as airbag controllers and pacemakers.