A) David A. Huffman B) John Smith C) Alice Jones D) Robert Johnson
A) Fixed-length encoding B) Variable-length encoding C) Binary encoding D) ASCII encoding
A) Rare symbols B) Symbols at odd indices C) Frequent symbols D) Symbols starting with A
A) A code that uses only 0s and 1s B) A code that starts with the same symbol C) A code where no codeword is a prefix of another D) A code with equal-length codewords
A) O(n) B) O(n2) C) O(log n) D) O(n log n)
A) Stack B) Queue C) Linked list D) Binary heap
A) Least frequent symbol B) Most frequent symbol C) Symbol with the longest name D) Symbol with a prime number
A) Optimal binary tree B) Perfect tree C) Balanced tree D) Complete tree
A) Compressing the data B) Building a linked list C) Assigning binary codes to symbols D) Calculating symbol frequencies
A) Suffix codes B) Postfix codes C) Infix codes D) Prefix codes
A) Memory consumption B) Encoding speed C) Compression ratio D) Number of symbols |