questions","basePath":"/gcse/computer-science/aqa/data-compression/questions","formulaUrl":null,"initialIndex":36,"initialQuestionWindow":[{"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},{"id":"9c7a4190-294d-468f-a0d3-4a4910f9f44d","revisionId":"a14cecf6-59f0-40f3-8e12-48dfbe2e8b52","questionNumber":null,"questionType":"LA","specification":"A fleet of autonomous scientific research buoys transmits daily oceanographic telemetry files to a central server via a high-cost, low-bandwidth satellite connection.","difficulty":3,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"916b3ba5-2157-455f-89a5-d58dff7393f7","label":null,"content":"State two benefits of applying data compression to these files prior to transmission.","markscheme":"- Reduces transmission costs because satellite networks typically charge based on the volume of data transferred. B1\n- Decreases transmission time, meaning the buoy's radio transmitter operates for less time, conserving battery power. B1\n- Fits within restricted bandwidth limits or short communication windows when a satellite is overhead. B1\n- Conserves local storage on the buoy, allowing more historical data to be archived before being overwritten. B1","marks":2,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"a7484418-cd62-4496-83ba-fb3e31c3cfb2","revisionId":"78f0e830-4512-4301-8a0b-99342da47a02","questionNumber":null,"questionType":"LA","specification":"A Huffman tree has been created for the phrase 'DEEP BLUE'.\n\n![Huffman tree for DEEP BLUE](https://assets.mathsgenie.co.uk/aqa-qb/1a868ffc-5ce1-4bc8-8b30-83fe75d12a49.png)","difficulty":3,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"7db92424-029b-40d7-bc2d-4195119d4b7c","label":null,"content":"What is the correct binary encoding for the substring **BLED**?\n\n| Letter | Binary Encoding |\n| :--- | :--- |\n| B | |\n| L | |\n| E | |\n| D | |\n\nWrite your final full sequence below your table.","markscheme":"- Identifies at least 3 of the correct individual letter encodings: $B = 011$, $L = 100$, $E = 11$, $D = 000$ M1\n- Correctly joins the binary codes to form the complete sequence $01110011000$ 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","diffic

Data compression

Question 23

Data compression Questions

Data compression

Question 23

Data compression Questions