questions","basePath":"/gcse/computer-science/aqa/data-compression/questions","formulaUrl":null,"initialIndex":59,"initialQuestionWindow":[{"id":"eba9b02a-0b55-4f3e-9cee-abb2251a8431","revisionId":"901d7458-eb6b-49c9-a289-27588ab8a0e4","questionNumber":null,"questionType":"LA","specification":"","difficulty":3,"difficultyBand":"easy","totalMarks":3,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"ca836c91-0e34-4cb8-a9dd-535eb9aa6e1c","label":null,"content":"Complete the code table below for characters P, T, and R for the Huffman tree shown in **Figure 1**. The code for character E has already been completed.\n\n| Character | Binary code |\n|-----------|-------------|\n| E | 0 |\n| P | |\n| T | |\n| R | |\n\n![A binary Huffman tree with a root node labelled with frequency 13. The left branch is labelled '0' and leads directly to leaf node 'E' with frequency (5). The right branch is labelled '1' and leads to an intermediate node with frequency (8). From node (8), the left branch is labelled '0' and leads to leaf node 'P' with frequency (3); the right branch is labelled '1' and leads to an intermediate node with frequency (5). From node (5), the left branch is labelled '0' and leads to leaf node 'T' with frequency (2); the right branch is labelled '1' and leads to leaf node 'R' with frequency (3).](https://assets.mathsgenie.co.uk/aqa-qb/8f74fc7f-af63-420a-a8a0-791b5f7d05de.png)","markscheme":"- Identifies the binary code for character **P** as $10$ B1\n- Identifies the binary code for character **T** as $110$ B1\n- Identifies the binary code for character **R** as $111$ B1","marks":3,"order":0,"markingRubric":null,"explanation":null,"options":[]}],"options":[],"explanation":null,"firstAttemptFullMarks":null},{"id":"fd397acf-ee36-4a99-b23d-5f594f5a85b7","revisionId":"74969f60-39a1-432d-8ab4-8a6042c556d4","questionNumber":null,"questionType":"LA","specification":"","difficulty":2,"difficultyBand":"easy","totalMarks":2,"sourceTitle":null,"calculatorUse":null,"parts":[{"id":"d04b7b5d-b4c7-47cf-8a04-e99694af14e7","label":null,"content":"Give **two** benefits of using data compression when sending files as email attachments.","markscheme":"- Reduced file size / storage saving: The file takes up less storage space on the email server or the user's drive B1\n- Faster transmission: Since the file is smaller, it requires less time to upload from the sender and download by the recipient B1\n- Bandwidth conservation: Transmitting smaller files uses less data, which is useful on metered connections and reduces network congestion B1\n- Meeting size limits: Many email clients have strict limits on attachment sizes; compression brings large files under this limit B1","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":"medium","calculatorUse":null},{"id":"2517e7f4-de71-4ffb-ad43-2cd8a3eaa98f","difficultyBand":"easy","calculatorUse":null},{"id":"2ca188af-e4f7-4602-a35a-d74493ab6e9a","difficultyBand":"medium","calculatorUse":null},{"id":"2f1b531d-bb44-4867-9f10-dac80122e335","difficultyBand":"medium","calculatorUse":null},{"

Data compression

Question 41

Data compression Questions

Data compression

Question 41

Data compression Questions