Study guide

13.2 Encoding Text, Images, and Sound

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.2 Encoding Text, Images, and Sound

Key Takeaways Explain This Topic AI

ASCII uses 7 bits for 128 characters ('A' = 65, 'a' = 97, '0' = 48); UTF-8 encodes Unicode in 1 to 4 bytes per character and matches ASCII for its first 128 characters.

To decode with a given scheme, split the bits into the code lengths the scheme specifies and look up each code; for example, with A = 00, C = 01, G = 10, T = 11, the bits 01111000 decode to CTGA.

A raster image stores a grid of pixels; uncompressed size in bytes is width × height × bits per pixel ÷ 8, so 800 × 600 at 24 bits is 1,440,000 bytes.

24-bit RGB color uses 8 bits (0–255) per channel, giving 16,777,216 colors, written in hexadecimal as #RRGGBB.

Digital sound is sampled at regular intervals; the sampling rate must exceed twice the highest frequency, and uncompressed size is sample rate × bit depth × channels × seconds ÷ 8.

Last updated: September 2026

What this competency asks

Under "bits as the universal medium," ETS asks you to encode or decode data given the description of an encoding scheme . Questions may define an unfamiliar code and ask you to apply it, or they may assume standard encodings such as ASCII and RGB. The discussion questions also ask how numbers, characters, and colors are represented as bits.

Applying any encoding scheme

An encoding scheme is an agreed-upon mapping between information and bit patterns. To use one:

Note whether codes are fixed-length (every code has the same number of bits) or variable-length .

For fixed-length codes, split the bits into equal groups. For variable-length prefix codes, where no code is the start of another, read bits until they match a code, then start again.

Look up each group.

Example (fixed length): DNA bases coded as A = 00, C = 01, G = 10, T = 11.

Encode "GATC": 10 00 11 01, which gives 10001101 .

Decode 01111000 : 01 | 11 | 10 | 00, which is CTGA .

With 4 symbols, 2 bits each suffice, since 2² = 4. With 5 symbols you would need 3 bits (Section 13.1).

Example (variable length, prefix code): A = 0, B = 10, C = 11. Decoding 010110 reads 0 → A, 10 → B, 11 → C, 0 → A, giving ABCA . Section 13.3 shows how Huffman coding builds such codes to save space.

Text

  • Encoding Size per character Coverage
  • ASCII 7 bits (usually stored in 1 byte) 128 characters: English letters, digits, punctuation, control codes
  • Extended 8-bit sets 1 byte 256 characters; different regions used conflicting tables

Unicode, UTF-8 1–4 bytes Nearly all writing systems plus symbols and emoji; the first 128 code points match ASCII

Unicode, UTF-16 2 or 4 bytes Used internally by Java and JavaScript

Useful ASCII codes: space = 32, '0' = 48 through '9' = 57, 'A' = 65 through 'Z' = 90, 'a' = 97 through 'z' = 122. Lowercase letters are exactly 32 higher than uppercase, so 'a' − 'A' = 32. Because digit characters are codes, the character '7' (55) is not the number 7. Programs convert by subtracting '0' . Code comparisons also explain why "Zebra" sorts before "apple" (Section 7.2).

Text file size: characters × bytes per character. A 5,000-character essay in ASCII or plain-English UTF-8 is about 5,000 bytes.

  • Images
  • Raster (bitmap) images

A raster image is a grid of pixels . Two numbers determine its uncompressed size:

Resolution: width × height in pixels.

Color depth: bits per pixel. 1 bit gives black and white; 8 bits give 256 colors or grays; 24 bits give 16,777,216 colors.

Size in bytes = width × height × bits per pixel ÷ 8

For 800 × 600 at 24 bits: 480,000 pixels × 3 bytes = 1,440,000 bytes , about 1.44 MB. For 1920 × 1080 at 24 bits: 2,073,600 × 3 = 6,220,800 bytes , about 6.2 MB.

Doubling both the width and the height quadruples the pixel count and the file size.

RGB color

Screens mix red, green, and blue light. In 24-bit color each channel has 8 bits (0–255), written as hex pairs #RRGGBB :

  • Hex RGB Color
  • #FF0000 255, 0, 0 Red
  • #00FF00 0, 255, 0 Green
  • #0000FF 0, 0, 255 Blue
  • #FFFF00 255, 255, 0 Yellow (red + green light)
  • #FFFFFF 255, 255, 255 White
  • #000000 0, 0, 0 Black
  • #808080 128, 128, 128 Medium gray

A 32-bit color adds an 8-bit alpha channel for transparency.

Vector images

A vector image stores shapes as mathematical descriptions, such as lines, curves, fill colors, and coordinates (SVG, for example). It scales to any size without pixelation and is compact for logos, icons, and diagrams, but it is unsuitable for photographs. Raster images blur or pixelate when enlarged beyond their resolution.

Sound

Sound is a continuous wave. Analog-to-digital conversion measures (samples) its amplitude at regular intervals and stores each measurement as a number.

Sampling rate: samples per second (Hz). The Nyquist–Shannon principle: to capture a frequency, sample at more than twice it. Human hearing reaches about 20 kHz, so CDs use 44.1 kHz .

Bit depth: bits per sample. More bits give finer amplitude steps and a wider dynamic range: 16-bit (CD) has 65,536 levels, about 96 dB.

Channels: 1 for mono, 2 for stereo.

Size in bytes = sample rate × bit depth × channels × seconds ÷ 8

For 4 minutes of CD-quality stereo: 44,100 × 16 × 2 × 240 ÷ 8 = 42,336,000 bytes , about 42 MB (roughly 10 MB per minute).

Sampling too slowly causes aliasing , where high frequencies masquerade as lower ones. Using fewer bits per sample adds audible noise.

The trade-off in every encoding

More bits per unit (per character, per pixel, per sample) means better fidelity and bigger files. Fewer bits means smaller files and less detail. Compression (Section 13.3) reduces size further, either exactly (lossless) or approximately (lossy).