All categories

2 years ago

nder a Huffman encoding ofnsymbols with frequenciesf1, f2, . . . , fn, what is the longest a codewordcould possibly be

Computers and Technology

1 answer:

Natasha2012 [34]2 years ago

5 0

Answer:

The longest codeword that could possibly be for "n" symbol is n-1 bits.

Explanation:

From the given information:

Suppose we are to consider a set of frequencies $\mathtt{f_1,f_2,f_3 ...,f_n}$ , for which f is a symbol for the length n. Therefore, the longest codeword that could possibly be for "n" symbol is n-1 bits.

However, during the encoding for "n" in conjunction with n-2, then the possibilities for n are; $\mathtt{\dfrac{1}{2}, \dfrac{1}{4}, ... \dfrac{1}{2^{n-2}}}$

We can conclude that the longest codeword that could possibly be for "n" symbol is n-1 bits.

You might be interested in

A user is claiming a host can be reached via the IP address but not through the name. What should a technician do first to resol

bagirrra123 [75]

Answer:

Add an entry to the HOSTS file

Explanation:

A file that is used to add the host name along with their IP addresses is called Host file. In this file all the IP addresses are mapped with their respective host names. Whenever some user tries to access some website, he may use the name of website to access it. The website have both name and IP address of the server, both of these information stored in host file. On GUI the user only see the information of Host name.

If some user only access the IP address of the website instead of the host name. The technician should add the name and IP address of the host in Host file. He should follow the following steps to resolve the problem.

Access the host file by following the given path of file in Windows operating system.
open the host file
edit the file with new host name and relevant IP address
save the changes

3 0

3 years ago

1.) what is the minimum number of bits required to represent -3,997 using 2's complement form?

lisabon 2012 [21]

The binary representation of +3997 is 1111 1001 1101.

In one's complement this is simply adding a sign bit and inverting all the bits:

1 0000 0110 0010

The two's complement is the one's complement plus 1:

1 0000 0110 0011

That's 13 bits. Normally the sign bit would be at an 8, 16 or 32,... bit boundary.

For -436 it's 10 0100 1100 and 10 bits

8 0

3 years ago

no one can succeed in his or her career without relying on others for help or opportunities. It’s best, though,

fenix001 [56]

idk good luck man idek if this is a question but if it is just go with c or b

3 0

3 years ago

WRITE A PROGRAM TO CALCULATE SIMPLE INTEREST

Alchen [17]

The simple interset program is a sequential program, and does not require loops and conditions

The simple interset program in Python, where comments are used to explain each line is as follows:

#This gets input for the principal amount

P = int(input("P = "))

#This gets input for the rate

R = int(input("R = "))

#This gets input for the number of years

N = int(input("N = "))

#This calculates the simple interest

I = P * R * T * 0.01

#This prints the simple interest

print("Simple Interest =",I)