questions","basePath":"/gcse/computer-science/aqa/data-compression/questions","formulaUrl":null,"initialIndex":51,"initialQuestionWindow":[{"id":"cb89bf50-9199-4aba-a3a7-8c60437b965d","revisionId":"9fabf9de-8dd2-41fd-91c4-b15467920902","questionNumber":null,"questionType":"LA","specification":"Using the Huffman codes shown in **Figure 1**, complete the partial Huffman tree shown in **Figure 2** by identifying which character belongs in each of the empty leaves: **Leaf X**, **Leaf Y**, and **Leaf Z**.\n\n### Figure 1: Character Codes\n\n| Character | Binary code |\n| :--- | :--- |\n| M | 1 |\n| K | 00 |\n| L | 010 |\n| J | 011 |\n\n### Figure 2: Partial Huffman Tree\n\n![Partial Huffman Tree](https://assets.mathsgenie.co.uk/aqa-qb/3a0af10c-87a4-402e-ba2a-08e53024e5a9.png)\n\nState the character for:","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"1c24307a-f255-4de7-a829-7ba44294c7ec","label":"a","content":"Leaf X","markscheme":"- Identifies that the path to Leaf X is left (0) -> left (0), giving the code $00$, which corresponds to character **K** B1","marks":1,"order":0,"markingRubric":null,"explanation":null,"options":[]},{"id":"7416206e-c9a3-4a6f-aa44-124a6ee5d031","label":"b","content":"Leaf Y","markscheme":"- Identifies that the path to Leaf Y is left (0) -> right (1) -> left (0), giving the code $010$, which corresponds to character **L** B1","marks":1,"order":1,"markingRubric":null,"explanation":null,"options":[]},{"id":"45160e3e-e618-46c2-9447-b220b2c8605b","label":"c","content":"Leaf Z","markscheme":"- Identifies that the path to Leaf Z is left (0) -> right (1) -> right (1), giving the code $011$, which corresponds to character **J** B1","marks":1,"order":2,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"d6787a37-d331-4efd-bb8d-a3228aff8346","revisionId":"0f607622-9c61-4bf3-bf46-9588c25b564e","questionNumber":null,"questionType":"LA","specification":"","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"ddf37f13-a3d3-4ebc-b658-d0f1677767de","label":null,"content":"Using the Huffman tree in Figure 1, complete the table to show the Huffman coding for the characters **E**, **SPACE**, and **M**.\n\n![A Huffman tree diagram for the text 'TEA TIME'](https://assets.mathsgenie.co.uk/aqa-qb/acd907a4-cca5-4232-af36-66d6af8c0bc0.png)\n\n| Character | Huffman Coding |\n| :--- | :--- |\n| E | |\n| SPACE | |\n| M | |","markscheme":"- Identifies the correct Huffman code for **E** as $11$ A1\n- Identifies the correct Huffman code for **SPACE** as $001$ A1\n- Identifies the correct Huffman code for **M** as $011$ A1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"dd3cd682-357f-4a51-9339-0062ff6b2140","revisionId":"bb5ff7ba-c465-4fee-9307-6012fb14e213","questionNumber":null,"questionType":"LA","specification":"A digital image sensor transmits a single line of pixel data represented by the following sequence of characters:\n\n`WWWWWWBBBBBGGGGGGGGW`","difficulty":3,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"1e767477-089d-467d-b38c-6fc84b0a5ef2","label":null,"content":"State a run-length encoding (RLE) representation of this sequence.","markscheme":"- Identifies the correct frequency of each consecutive character run: six Ws, five Bs, eight Gs, and one W M1\n- Compiles these into a valid, consistent RLE representation, such as `6W5B8G1W` or `W6B5G8W1` 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-75964ab470

Data compression

Question 35

Data compression Questions

Data compression

Question 35

Data compression Questions