Study guide
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers
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
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers
Key Takeaways Explain This Topic AI
Computers use binary because two-state electronic components (on or off, high or low voltage) are simple, reliable, and resistant to noise, and Boolean logic maps directly onto them.
n bits can represent 2ⁿ different values, so storing k different values requires ⌈log₂ k⌉ bits; for example, 26 letters need 5 bits, because 2⁵ = 32.
A byte is 8 bits; storage units step up by about 1,000 (or exactly 1,024): kilobyte, megabyte, gigabyte, terabyte, petabyte.
Network speeds are usually quoted in bits per second, so a 100 Mbps connection transfers at most about 12.5 megabytes per second.
In 8-bit two's complement, values run from −128 to +127, and 11110100 represents −12.
Last updated: September 2026
What this competency asks
ETS asks you to understand bits as the universal medium for expressing digital information . That includes:
Perform calculations using bits and bytes.
Determine the number of bits and bytes required to store a given amount of data.
Explain why binary numbers are fundamental to the operation of computer systems.
It also includes encoding schemes and compression (Sections 13.2 and 13.3). Under data storage, ETS adds: identify measures of file size (byte, kilo, mega, giga, tera, peta) . ETS's sample question on storage multiplies out assumptions about a university library's books, pages, lines, words, and characters to get about 3 × 10¹² bytes, which is best measured in terabytes .
Why binary?
Reliability: a circuit only has to distinguish two states, such as high and low voltage, charged and uncharged, or magnetized one way or the other. That is far more tolerant of electrical noise than distinguishing ten levels.
Simple hardware: transistors act as switches, and logic gates built from them compute Boolean functions (Section 7.4).
Universality: any information can be encoded as bits: numbers (Section 4.3), text, colors, sound, and the program instructions themselves.
The meaning of a bit pattern depends on how it is interpreted. 01000001 is the number 65, the character 'A' in ASCII, or part of a color. Bits are abstractions all the way up (Section 4.1).
How many values? How many bits?
- Bits Distinct values (2ⁿ) Example use
- 1 2 true / false
- 4 16 One hex digit
- 5 32 26 letters
- 7 128 ASCII characters
- 8 256 One byte; one color channel
- 16 65,536 CD-quality audio sample
- 24 16,777,216 RGB color (8 bits × 3)
- 32 about 4.3 billion IPv4 addresses
To store k different values, you need ⌈log₂ k⌉ bits : the smallest n with 2ⁿ ≥ k.
50 U.S. states: 2⁵ = 32 is too few and 2⁶ = 64 is enough, so 6 bits .
1,000 student IDs: 2¹⁰ = 1,024 ≥ 1,000, so 10 bits .
Adding one bit doubles the number of values. Going from 8 to 9 bits takes you from 256 to 512.
Units of storage
- Unit Symbol Decimal (SI) Binary (power of 2)
- Byte B 8 bits 8 bits
- Kilobyte KB 10³ = 1,000 bytes 2¹⁰ = 1,024 bytes (KiB)
- Megabyte MB 10⁶ bytes 2²⁰ bytes (MiB)
- Gigabyte GB 10⁹ bytes 2³⁰ bytes (GiB)
- Terabyte TB 10¹² bytes 2⁴⁰ bytes (TiB)
- Petabyte PB 10¹⁵ bytes 2⁵⁰ bytes (PiB)
Each step is about 1,000 times the last. ETS's sample question lists each unit with both forms, for example "gigabyte (2³⁰, or approximately 10⁹, bytes)". For estimating, treat each step as a factor of 1,000.
Bits vs. bytes: a lowercase b means bits and an uppercase B means bytes. Network speeds use bits (Mbps), and file sizes use bytes (MB). A 100 Mbps connection moves at most 100 ÷ 8 = 12.5 MB per second , so a 1 GB file (8,000 megabits) takes at least 8,000 ÷ 100 = 80 seconds .
Estimating storage: multiply the assumptions
Set up a chain of multiplications with units, then choose the unit whose size is closest.
Example: A district archives 2,000 hours of classroom video at about 1.5 GB per hour.
2,000 × 1.5 GB = 3,000 GB = 3 TB .
Example: A school stores 1,200 student portfolios, each with 50 photos of about 3 MB.
1,200 × 50 × 3 MB = 180,000 MB = 180 GB, so gigabytes are the best unit.
Plain text: at 1 byte per character, a 300-page book with about 2,000 characters per page is 600,000 bytes, roughly 0.6 MB .
Keep powers of ten separate to avoid slips. For example, 3 × 10⁶ books × 4 × 10² pages × 5 × 10¹ lines = 60 × 10⁹ lines.
Unsigned and signed integers
With n bits :
Unsigned integers range from 0 to 2ⁿ − 1. With 8 bits, that is 0 to 255.
Signed integers in two's complement range from −2ⁿ⁻¹ to 2ⁿ⁻¹ − 1. With 8 bits, that is −128 to +127.
Two's complement gives the leftmost bit a negative weight, −2ⁿ⁻¹. In 8 bits, 11110100 = −128 + 64 + 32 + 16 + 4 = −12 .
To negate a number: invert every bit, then add 1. For +43 = 00101011 : inverting gives 11010100 , and adding 1 gives 11010101 , which is −43.
Why two's complement? There is only one zero, and the same adder circuit handles addition and subtraction, since a − b = a + (−b).
Overflow
A result outside the representable range overflows . In 8-bit two's complement, 100 + 50 = 150 exceeds 127: 01100100 (+100)
- + 00110010 (+50)
- = 10010110 (read as −106)
Adding two positive numbers and getting a negative result, or two negatives and getting a positive, signals overflow. Adding a positive and a negative number can never overflow. The same effect causes Java's largest int , 2,147,483,647, plus 1 to wrap to −2,147,483,648 (Section 10.2).
Real numbers take approximations
Floating-point formats (IEEE 754) store a sign, an exponent, and a fraction in binary. Many decimal fractions, such as 0.1, repeat forever in binary, so they are stored approximately , which causes the round-off errors discussed in Sections 7.1 and 10.2.