What is data compression?
Data compression represents information with fewer bits than an uncompressed representation, reducing storage requirements and transmission time.
Study 4. Data Compression with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is data compression?
Data compression represents information with fewer bits than an uncompressed representation, reducing storage requirements and transmission time.
What is redundancy in data compression?
Redundancy is repeated, predictable, or perceptually unimportant information that can be represented more efficiently.
How does run-length encoding reduce repetition?
Run-length encoding replaces repeated values with a value and a count; for example, AAAAABBB becomes 5A3B.
How does Huffman coding exploit statistical redundancy?
Huffman coding assigns short codes to frequent symbols and longer codes to rare symbols, exploiting statistical redundancy.
What is spatial redundancy?
Spatial redundancy occurs when nearby pixels have similar colors; storing differences between neighbors can use fewer bits than storing each color independently.
What is temporal redundancy?
Temporal redundancy occurs when consecutive audio or video frames are similar, allowing later frames to store only changes from a complete frame.
What is perceptual redundancy?
Perceptual redundancy is information people may not notice, such as tiny color changes or sounds masked by louder sounds; lossy compression may remove it.
How is compression ratio calculated?
Compression ratio = original size ÷ compressed size. A 10 MB file reduced to 2 MB has a ratio of 5:1.
What does lossless compression guarantee?
Lossless compression reconstructs the original data exactly, bit for bit, without discarding information.
How does LZ77 perform dictionary coding?
Dictionary coding replaces repeated strings with references to dictionary entries. LZ77 refers to earlier matching sequences within a sliding window.
What is the purpose of PNG filtering?
PNG filters transform scanlines to make patterns easier to compress; the filters themselves do not reduce bytes and can be reversed exactly.
What does lossy compression do?
Lossy compression produces an approximation by discarding information judged less important, often using models of visual or auditory perception.
A medium-difficulty assessment of programming fundamentals, algorithmic problem solving, control flow, data structures, testing, debugging, complexity, and decidability. Questions progress from foundational understanding to applied reasoning.
A practical review of the integrated Java skills, debugging habits, algorithm reasoning, and free-response strategies needed for AP Computer Science A.
A progressive guide to designing, operating, and testing systems that continue useful service despite component faults, overload, data loss, and recovery challenges.
A medium-difficulty quiz on how independently operated networks, protocols, addresses, naming systems, transport services, and routing mechanisms work together to form the Internet.
Learn how to create, modify, traverse, and analyze Java lists with ArrayList, wrapper types, standard algorithms, and the Collections utility class for AP Computer Science A.
Build a clear understanding of Java Boolean expressions, logical operators, selection statements, nested branching, equivalent logic, and systematic code tracing for AP Computer Science A.
A practical introduction to Java program structure, data types, operators, input and output, problem-solving strategy, testing, and debugging for AP Computer Science A.
A practical guide to Java inheritance, constructor chaining, method overriding, polymorphism, access control, and object behavior for tracing and writing AP Computer Science A programs.
A focused guide to Java classes, object references, constructors, methods, strings, wrapper classes, and API usage for AP Computer Science A.
A focused guide to Java primitive types, expression evaluation, numeric conversion, floating-point behavior, integer overflow, and common methods in the Math class for AP Computer Science A.
A focused review of Java primitive types, expression evaluation, numeric conversion, arithmetic behavior, Math methods, randomness, and tracing techniques for AP Computer Science A.
A progressive guide to how packet-switched networks encapsulate data, move it across links, and manage delay, throughput, queues, and congestion.