Homework Answers
Add Answer to:
Consider the following symbols with their corresponding frequencies: A:1, B:1, 0:2, D:3, E:5, F:8, G :...
We have the symbols A, B, C, D, E, F, G, H with frequencies 1, 1,...
We have the symbols A, B, C, D, E, F, G, H with frequencies 1, 1, 2, 4, 8, 16, 32, 64. Show the Huffman tree and Huffman code for the symbols. How much compression does a 1000 digit file use when using this Huffman code based on an 8-bit ASCII code (ie, ISO 8859-1)?
An alphabet contains symbols A, B, C, D, E, F. The frequencies of the symbols are...
An alphabet contains symbols A, B, C, D, E, F. The frequencies of the symbols are 35%, 20%, 15%, 15%, 8%, and 7%, respectively. We know that the Huffman algorithm always outputs an optimal prefix code. However, this code is not always unique (obviously we can, e.g., switch 0’s and 1’s and get a different code - but, for some inputs, there are two optimal prefix codes that are more substantially different). For the purposes of this exercise, we consider...
Problem (A1) (20 points): Huffman Coding Consider a message having the 5 symbols (A,B,C,D,E) with probabilities...
Problem (A1) (20 points): Huffman Coding Consider a message having the 5 symbols (A,B,C,D,E) with probabilities (0.1,0.1,0.2 ,0.2, 0.4), respectively. For such data, two different sets of Huffman codes can result from a different tie breaking during the construction of the Huffman trees. • Construct the two Huffman trees. (8 points) Construct the Huffman codes for the given symbols for each tree. (4 points) Show that both trees will produce the same average code length. (4 points) For data transmission...
4. Consider the given seven symbols with probabilities as {A, B, C, D, E, F, G}...
4. Consider the given seven symbols with probabilities as {A, B, C, D, E, F, G} = {0.25, 0.20, 0.18, 0.15, 0.12, 0.06, 0.04}. Use Huffman coding to determine coding bits, entropy and average bits per symbol.
Question 1. What is the optimal Huffman code for the following set of characters frequencies? a:1...
Question 1. What is the optimal Huffman code for the following set of characters frequencies? a:1 b:1 c:2 d:3 e:5 f:8 g:13 h:21
5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message...
5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message with the following frequencies: 22, 6, 13, 19, 2, 9, 25, 4. (a) Use Huffman tree to design an optimal binary prefix code for the letters. (b) What is the average bit length of the message after apply codes designed in (a) to the message? [20 marks]
Design the optimal (Huffman) code for the alphabet {a, b, c, d, e, f, g, h,...
Design the optimal (Huffman) code for the alphabet {a, b, c,
d, e, f, g, h, i, j, k, l}, where frequencies are given in the
table below:
Draw the appropriate decoding tree.
a 0.25 g 0.02 b 0.01 h 0.12 c 0.09 i 0.15 d 0.02 j 0.04 e 0.24 k 0.01 f 0.04 l 0.01
A long string consists of the six characters A, B, C, D, E, F, G; they...
A long string consists of the six characters A, B, C, D, E, F, G; they appear with frequency 21%, 11%, 8%, 17%, 5%, 23%, and 15%, respectively. (a) Draw the Huffman encoding tree of these six characters. (b) What is the Huffman encoding of these six characters? (c) If this encoding is applied to a string consisting of one million characters with the given frequencies, what is the length of the encoded string in bits?
. Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach...
. Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach character is given a binary representation with the same number of bits. What is the minimum number of bits required to represent each letter of this file under fixed-length encoding scheme? Describe how to encode all seven letters in this file using the number of bits...
You will construct a Huffman tree based on the given frequencies of 26 English alphabets in...
You will construct a Huffman tree based on the given frequencies of 26 English alphabets in upper case plus the space character. An internal tree node class in HuffmanTree with necessary information is required. • You will not randomly switch left and right children when merger two trees. Instead, you will build a right-heavy tree according to the following strategies to select the right child. (1) The tree that is taller will be the right child, i.e., the height is...
Problem (A1) (20 points): Huffman Coding Consider a message having the 5 symbols (A,B,C,D,E) with probabilities (0.1,0.1,0.2 ,0.2, 0.4), respectively. For such data, two different sets of Huffman codes can result from a different tie breaking during the construction of the Huffman trees. • Construct the two Huffman trees. (8 points) Construct the Huffman codes for the given symbols for each tree. (4 points) Show that both trees will produce the same average code length. (4 points) For data transmission...
Question 1. What is the optimal Huffman code for the following set of characters frequencies? a:1 b:1 c:2 d:3 e:5 f:8 g:13 h:21
5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message with the following frequencies: 22, 6, 13, 19, 2, 9, 25, 4. (a) Use Huffman tree to design an optimal binary prefix code for the letters. (b) What is the average bit length of the message after apply codes designed in (a) to the message? [20 marks]
Design the optimal (Huffman) code for the alphabet {a, b, c,
d, e, f, g, h, i, j, k, l}, where frequencies are given in the
table below:
Draw the appropriate decoding tree.
a 0.25 g 0.02 b 0.01 h 0.12 c 0.09 i 0.15 d 0.02 j 0.04 e 0.24 k 0.01 f 0.04 l 0.01
. Huffman Encoding (a.) (6 points) Suppose a certain file contains only the following letters with the corresponding frequencies 1 AİB 73 9 30 44 130 28 16 In a fixed-length encoding scheme, cach character is given a binary representation with the same number of bits. What is the minimum number of bits required to represent each letter of this file under fixed-length encoding scheme? Describe how to encode all seven letters in this file using the number of bits...
Most questions answered within 3 hours.
-
If X has a normal distribution with mean µ =
12 and variance σ2 = 9,...
asked 1 minute ago -
Electrons flow through a 2.7-mm-diameter aluminum wire at
2.5×10−4 m/s .
How many electrons move through...
asked 3 minutes ago -
For a recent year, McDonald’s (MCD)
company-owned restaurants had the following sales and expenses (in
millions):...
asked 2 minutes ago -
An example of an operational taxonomic unit
(OTU) is
a. Multiple sequence alignment.
b. Protein sequence....
asked 3 minutes ago -
In a sample of 15 men, the mean height was 171 cm. In a sample
of...
asked 4 minutes ago -
In this exercise, we will be refactoring a working program. Code
refactoring is a process to...
asked 1 hour ago -
3
researchers at Cambrige looked at 5,000 firms in Englans and found
that, in terms of...
asked 1 hour ago -
why it is important and how it integrates within ERP? And what
the core challenges of...
asked 3 hours ago -
A strawberry farmer determines that the average weight of
individual strawberries produced by plants in his...
asked 3 hours ago -
Chargaff's results yielded a molar ratio of 0.400 for A to G in
avian tubercle bacillus...
asked 6 hours ago -
Which of the following binds ATP/ADP?
a. microfilaments
b. microtubules
c. intermediate filaments
d. microfilaments and...
asked 6 hours ago -
Assume that the situation can be expressed as a linear cost
function. Find the cost function....
asked 7 hours ago