1) What is Huffman coding used for? a) Image editing b) Data compression c) Error checking d) Encryption 2) Huffman coding is mainly what type of compression? a) Lossless b) Encrypted c) Lossy d) Analog 3) Huffman coding uses what kind of code lengths? a) Random length b) Fixed length c) Variable length d) Equal length 4) Huffman coding assigns shortest codes to symbols with what frequency? a) Unknown b) Zero c) Lowest d) Highest 5) What structure is built to create Huffman codes? a) Matrix b) Binary tree c) Queue d) Hash table 6) In Huffman coding, leaves of the tree represent what? a) Parity bits b) Edges c) Frequencies d) Symbols 7) What do internal nodes store in Huffman coding? a) Combined frequency b) Pixel data c) ASCII value d) Character codes 8) Which two nodes are combined first? a) Random nodes b) Root nodes c) Lowest frequencies d) Highest frequencies 9) What is used to repeatedly pick smallest frequencies efficiently? a) Array b) Stack c) Priority queue d) Register 10) A Huffman code is a type of what code? a) Caesar code b) Gray code c) Block code d) Prefix code 11) Prefix-free means what? a) Uses checksum b) No code is prefix c) Codes are hidden d) All codes same 12) Why is prefix-free important? a) Unambiguous decoding b) More encryption c) Better graphics d) Faster internet 13) In a Huffman tree, left edge is often labelled as what? a) 2 b) 0 c) A d) 1 14) In a Huffman tree, right edge is often labelled as what? a) B b) 0 c) 1 d) 2 15) What do you get by reading bits from root to leaf? a) Symbol code b) Parity bit c) Frequency list d) File header 16) What information is needed to decode Huffman data? a) CPU speed b) IP address c) Screen size d) Code table 17) What usually happens to common symbols in Huffman coding? a) Longer codes b) Shorter codes c) Encrypted d) Removed 18) What usually happens to rare symbols in Huffman coding? a) Ignored b) Duplicated c) Shorter codes d) Longer codes 19) Huffman coding works best when symbol frequencies are what? a) Uneven b) Unknown c) Equal d) Zero 20) What is one disadvantage of Huffman coding? a) Needs GPU b) Data loss c) Tree overhead d) Needs internet

Huffman Coding (OCR GCSE Computing)

prie
Spausdinti
Įterpti

Lyderių lentelė

Vizualinis stilius

Parinktys

Patobulintas dirbtinis intelektas: šioje veikloje yra dirbtinio intelekto sugeneruoto turinio. Sužinoti daugiau, sužinok daugiau.

Pakeisti šabloną

Atkurti automatiškai įrašytą: ?