sing the Alogrithm, encode the following string "Ghana Communication Technology University". Determine 1. The Huffman-tree. 2. The Huffman-code 3. The Average code length of bits saved 4. The proportion or percentage of bits saved when variable-length encoding is used instead of fixed length encoding scheme

sing the Alogrithm, encode the following string "Ghana Communication Technology University". Determine 1. The Huffman-tree. 2. The Huffman-code 3. The Average code length of bits saved 4. The proportion or percentage of bits saved when variable-length encoding is used instead of fixed length encoding scheme

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

q1- Public key algorithms are based on mathematical functions rather than on simple operations on bit patterns. Select one: True False
Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Bits А 000 2 E 001 H 010 1 K 011 1 М 100 3 101 1 R 110 2 S 111 1 T 1000 4 U 1001 1 space 1010 4 What are the total bits in the original code? Use Huffman Coding to compress the following phrase: "MEET ME AT THE SUPERMARKET". Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it.
Using the Huffman Algorithm, encode the following string “Dear Asiamah,”. Where Surname is your official or formal registered Surname as a student in GCTU. Determine (a) The Huffman-tree. (b) The Huffman-code (c) The average code length of bits saved. (d) The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
How might you encode audio (or video) data in two packets so that if one packet is lost, then the resolution is simply reduced to what would be expected with half the bandwidth? Explain why this is much more difficult if a JPEG-type encoding is used.
Map the Hamming distance and maximum correctable bits to the following encodings (b = binary, h = hexadecimal). 1. Correctable errors from (00h→0b), (FFh→1b) answer: 1/2/3/4/5/6/7/8/9 2. Hamming distance from (00h→0b), (FFh→1b) answer: 1/2/3/4/5/6/7/8/9 3. Hamming distance from (00h→00b), (0Fh→01b), (F0h→10b), (FFh→11b) answer: 1/2/3/4/5/6/7/8/9 4. Correctable errors from (00h→00b), (0Fh→01b), (F0h→10b), (FFh→11b) answer: 1/2/3/4/5/6/7/8/9
Which encoding technique has the highest throughput? Which one is currently seeing heavy data usage, and why?
Question What is the result of expanding the following LZW-encoded sequence of 12 hexadecimal integers? 41 43 43 42 81 41 42 82 85 41 41 80 Assume the original encoding table consists of all 7-bit ASCII characters and uses 8-bit codewords. Answer Your answer should be a sequence of uppercase letters, separated by whitespace.
What is the optimal encoding strategy to represent all the characters in the many languages spoken around the world?
Create a bit pattern assuming that the proportion is composed of base 15 values rather than base 2. (Base 16 numerals are denoted by the digits 0-9 and A-F. Base 15 numerals would employ the digits 0-9 and A-E.) Assume there are 24 bits and that no normalisation is required. Is this depiction accurate?
ki :Given the following stream of bits (01111000), encode these bits of the stream using NRZ-L, NRZ-I, RZ, Manchester and differential Manchester encoding methods
Q14. Convert the following 8-bit binary string to its base 10 equivalent: 01101011
Using the Huffman Algorithm, encode the following string “Dear Saba",.Determinei. The Huffman-treeii. The Huffman-codeiii. The average code length of bits savediv. The proportion or percentage of bits save when variable-length encoding is usedinstead of fixed length encoding scheme.