questions","basePath":"/gcse/computer-science/aqa/data-compression/questions","formulaUrl":null,"initialIndex":34,"initialQuestionWindow":[{"id":"7f354f80-bc7a-4db4-a96b-ff20751ebf52","revisionId":"27e6f028-aa09-47ac-ac39-9d67e06b7cda","questionNumber":null,"questionType":"LA","specification":"","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"3041be9c-057d-40fd-81ad-d4bae07cd219","label":null,"content":"Using the Huffman tree shown below, complete the table to determine the Huffman coding for the characters **F**, **C**, and **S**.\n\n![Huffman tree diagram](https://assets.mathsgenie.co.uk/aqa-qb/c6acf738-907d-4bd0-9636-781cfaecd40a.png)\n\n| Character | Huffman Coding |\n| :--- | :--- |\n| F | |\n| C | |\n| S | |","markscheme":"- Correct Huffman coding for **F** is $10$ B1\n- Correct Huffman coding for **C** is $000$ B1\n- Correct Huffman coding for **S** is $011$ B1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"8e3ba85b-19b3-4a8a-b6b0-9618b8152382","revisionId":"c37b3415-54fc-436e-93ff-a45f30a5bccf","questionNumber":null,"questionType":"LA","specification":"","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"470ae378-3778-4da0-a9d8-09273ec6716d","label":null,"content":"Complete the code table below for characters M, K, and B for the Huffman tree shown in Figure 1. The code for character H has already been completed.\n\n| Character | Binary code |\n|-----------|-------------|\n| H | 00 |\n| M | |\n| K | |\n| B | |\n\n![Figure 1: A binary Huffman tree](https://assets.mathsgenie.co.uk/aqa-qb/b848b6a5-7d8c-4047-923e-d192b6acd30e.png)","markscheme":"- Traces the path to leaf 'M' (left branch then right branch) to get the code `01` B1\n- Traces the path to leaf 'K' (right branch then left branch) to get the code `10` B1\n- Traces the path to leaf 'B' (right branch, right branch, then left branch) to get the code `110` B1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"983bc244-c876-4e62-8d9f-860ed1cc8bfd","revisionId":"d33187d0-fe78-48f6-aea5-e1a199a0d457","questionNumber":null,"questionType":"LA","specification":"A telemetry sensor transmits a sequence of status codes representing system states: 'S' for Stable, 'R' for Recovery, and 'P' for Peak.\n\nA segment of the recorded sequence is:\n\n`SSSRRRRRRRRRPP`","difficulty":3,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"2096ee0e-ab86-49d2-87b9-2c6a533bc6fd","label":null,"content":"State a run-length encoding (RLE) representation of this sequence.","markscheme":"- Identifies the correct run counts for each character run: 3 of 'S', 9 of 'R', and 2 of 'P' M1\n- Combines these into a valid, consistent RLE format, such as `3S9R2P` or `S3R9P2` A1","marks":2,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null}],"subjectCode":"gcse_computer_science__aqa","summaries":[{"id":"01aceeda-575c-4ced-bc96-ba092de79c7e","difficultyBand":"medium","calculatorUse":null},{"id":"03fe5cea-6efd-45d9-aa60-75964ab4705a","difficultyBand":"easy","calculatorUse":null},{"id":"07d36a1a-5c14-476d-80ea-f2079e422bfb","difficultyBand":"easy","calculatorUse":null},{"id":"0ab264e5-e293-4736-91b6-fd500dfb6b02","difficultyBand":"easy","calculatorUse":null},{"id":"0fc37e4c-7cae-4c1a-9fb3-66f966107332","difficultyBand":"medium","calculatorUse":null},{"id":"1cb71686-bddf-4766-bac7-646e97cdb718","difficultyBand":"easy","calculatorUse":null},{"id":"1d080ea0-8d9f-41a4-ae48-50a80dde2388","difficultyBand":"medium","calculatorUse":null},{"id":"2388faa7-f6e4-47a9-a80f-dc5cf1f23147","difficultyBand"

Data compression

Question 21

Data compression Questions

Data compression

Question 21

Data compression Questions