questions","basePath":"/gcse/computer-science/aqa/data-compression/questions","formulaUrl":null,"initialIndex":30,"initialQuestionWindow":[{"id":"678319ec-8323-4fb0-9822-ffa1ffddd3b7","revisionId":"f698d481-52da-4f01-ae50-1dab65896f74","questionNumber":null,"questionType":"LA","specification":"","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"3a3114f4-766e-401e-92fd-6ef4138c5b6c","label":null,"content":"Complete the code table below for characters O, N, and G using the Huffman tree shown in Figure 1. The binary code for character S has been filled in as an example.\n\n![Figure 1: Huffman tree for characters S, O, N, and G](https://assets.mathsgenie.co.uk/aqa-qb/16533544-d1b3-40c6-9243-f1072b135af9.png)\n\n| Character | Binary code |\n| :--- | :--- |\n| S | 1 |\n| O | |\n| N | |\n| G | |","markscheme":"- Traces the tree to find the correct binary code for O as $00$ B1\n- Traces the tree to find the correct binary code for N as $010$ B1\n- Traces the tree to find the correct binary code for G as $011$ B1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"6d3f5f4c-fdcf-44bc-ae19-7a7b3ff395b1","revisionId":"3d0bc114-ab64-455e-a401-d6e79aaa5f91","questionNumber":null,"questionType":"LA","specification":"A telemetry subsystem on a meteorological station encodes status data using a Huffman code. The Huffman tree shown below is generated from a sequence of status logs.\n\n![Huffman tree for sensor status data](https://assets.mathsgenie.co.uk/aqa-qb/2f6077cb-2bc9-46cb-8a92-357a1c7ace82.png)","difficulty":3,"difficultyBand":"easy","totalMarks":1,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"ae882a0e-c94c-4c95-91aa-be7ca2e39c8a","label":null,"content":"Determine the string represented by the binary sequence `0111000010011`.","markscheme":"- Decodes the binary sequence step-by-step:\n * `011` $\\rightarrow$ **S**\n * `100` $\\rightarrow$ **T**\n * `00` $\\rightarrow$ **A**\n * `100` $\\rightarrow$ **T**\n * `11` $\\rightarrow$ **E**\n to give the final decoded string **STATE** A1","marks":1,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"7bb9b0f1-348b-4b8c-8a7f-36a587a96902","revisionId":"bfd74973-ab68-4062-825d-ff465d11890f","questionNumber":null,"questionType":"LA","specification":"Using the Huffman codes shown in **Table 1**, complete the partial Huffman tree shown in **Figure 1** by identifying which character belongs in each of the empty leaves: **Leaf X**, **Leaf Y**, and **Leaf Z**.\n\n### Table 1: Character Codes\n\n| Character | Binary code |\n| :--- | :--- |\n| T | 0 |\n| A | 10 |\n| P | 110 |\n| S | 111 |\n\n### Figure 1: Partial Huffman Tree\n\n![Partial Huffman Tree](https://assets.mathsgenie.co.uk/aqa-qb/155668df-ea59-4412-aa02-5e4366d03494.png)\n\nState the character for:","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"b10af216-e181-4ab1-991b-e4a8122b1bd3","label":"a","content":"Leaf X","markscheme":"- Identifies that **Leaf X** corresponds to the path $10$, which represents the character **A** B1","marks":1,"order":0,"markingRubric":null,"explanation":null,"options":[]},{"id":"7c4a854e-0c10-4bc0-bafa-e22d5aa0adc2","label":"b","content":"Leaf Y","markscheme":"- Identifies that **Leaf Y** corresponds to the path $110$, which represents the character **P** B1","marks":1,"order":1,"markingRubric":null,"explanation":null,"options":[]},{"id":"0f6b81b7-caf1-47a0-adcd-ca17506c8535","label":"c","content":"Leaf Z","markscheme":"- Identifies that **Leaf Z** corresponds to the path $111$, which represents the character **S** B1","marks":1,"order":2,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null}],"subjectCode":"gcse_computer_science__aqa","sum

Data compression

Question 17

Data compression Questions

Data compression

Question 17

Data compression Questions