In Huffman encoding, both the sender and receiver must have a copy of the code a. Same b. Different c. Generate on Demand d. Both (a) and (b)

In Huffman encoding, both the sender and receiver must have a copy of the  code
a. Same
b. Different
c. Generate on Demand
d. Both (a) and (b)
by

1 Answer

Answer :

a. Same
by

Related questions

Huffman trees use the _______________ of each character to work out their encoding. a. Frequency b. Order in ASCII c. Number value d. Both (a) and (b)

Description : Huffman trees use the _______________ of each character to work out their encoding. a. Frequency b. Order in ASCII c. Number value d. Both (a) and (b)

Last Answer : a. Frequency

Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Description : Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Last Answer : A. Frequency

Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Description : Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Last Answer : A. Frequency

Huffman coding is an encoding algorithm used for A. lossless data compression B. files greater than 1 Mbit C. broadband systems D. lossy data compression

Description : Huffman coding is an encoding algorithm used for A. lossless data compression B. files greater than 1 Mbit C. broadband systems D. lossy data compression

Last Answer : A. lossless data compression

Huffman coding is an encoding algorithm used for a. lossless data compression b. files greater than 1 Mbit c. broadband systems d. lossy data compression

Description : Huffman coding is an encoding algorithm used for a. lossless data compression b. files greater than 1 Mbit c. broadband systems d. lossy data compression

Last Answer : a. lossless data compression

A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is A. 8.0 bit B. 2.0 bit C. 1.9 bit D. 2.1 bit

Description : A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is A. 8.0 bit B. 2.0 bit C. 1.9 bit D. 2.1 bit

Last Answer : C. 1.9 bit

Compression method use for Integer type data a. Huffman b. LZ77 c. Golomb Code d. Adaptive Huffman

Description : Compression method use for Integer type data a. Huffman b. LZ77 c. Golomb Code d. Adaptive Huffman

Last Answer : c. Golomb Code

Average length of Extended Huffman code is upper bounded by : a. R b. R+1 c. R-1 d. R+1/n

Description : Average length of Extended Huffman code is upper bounded by : a. R b. R+1 c. R-1 d. R+1/n

Last Answer : d. R+1/n

A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is a. 8.0 bit b. 2.0 bit c. 1.9 bit d. 2.1 bit

Description : A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is a. 8.0 bit b. 2.0 bit c. 1.9 bit d. 2.1 bit

Last Answer : c. 1.9 bit

An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.4, P(B) = 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is a. A = 01 B = 111 C = 110 D = 10 b. A = 0, B = 100, C = 101, D = 11

Description : An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.4, P(B) = 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is a. A = 01 B = 111 C = 110 D = 10 b. A = 0, B = 100, C = 101, D = 11

Last Answer : b. A = 0, B = 100, C = 101, D = 11

Extended Huffman method is used due to a. Large alphabet b. Skewed probability c. Equal probability d. Both (a) and(b)

Description : Extended Huffman method is used due to a. Large alphabet b. Skewed probability c. Equal probability d. Both (a) and(b)

Last Answer : b. Skewed probability

Total number of nodes in the adaptive huffman tree is: A. 2n+1 B. 2n C. 2n-1 D. 2n-2

Description : Total number of nodes in the adaptive huffman tree is: A. 2n+1 B. 2n C. 2n-1 D. 2n-2

Last Answer : C. 2n-1

Which formula shows how to work out the percentage a file has been compressed by? A. bits in (Huffman *7) /100 B. bits in ASCii - bits in Huffman C. difference in bits / bits in ASCII * 100

Description : Which formula shows how to work out the percentage a file has been compressed by? A. bits in (Huffman *7) /100 B. bits in ASCii - bits in Huffman C. difference in bits / bits in ASCII * 100

Last Answer : C. difference in bits / bits in ASCII * 100

How do you calculate the number of bits of a body of text in ASCII? A. Number of characters * 7 B. Number of characters (including spaces) *7 C. bits in Huffman * 7 D. bits in Huffman / 7

Description : How do you calculate the number of bits of a body of text in ASCII? A. Number of characters * 7 B. Number of characters (including spaces) *7 C. bits in Huffman * 7 D. bits in Huffman / 7

Last Answer : B. Number of characters (including spaces) *7

How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right D. 0 = middle 1 = back

Description : How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right D. 0 = middle 1 = back

Last Answer : C. 0 = left 1 = right

How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right 0 = middle 1 = back

Description : How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right 0 = middle 1 = back

Last Answer : C. 0 = left 1 = right

A Huffman encoder takes a set of characters with fixed length and produces a set of characters of A. fixed length B. constant length C. random length D. variable length

Description : A Huffman encoder takes a set of characters with fixed length and produces a set of characters of A. fixed length B. constant length C. random length D. variable length

Last Answer : D. variable length

The basic idea behind Huffman coding is to A. compress data by using fewer bits to encode fewer frequently occuring characters B. compress data by using fewer bits to encode more frequently occuring characters C. compress data by using more bits to encode more frequently occuring characters D. expand data by using fewer bits to encode more frequently occuring characters

Description : The basic idea behind Huffman coding is to A. compress data by using fewer bits to encode fewer frequently occuring characters B. compress data by using fewer bits to encode more ... frequently occuring characters D. expand data by using fewer bits to encode more frequently occuring characters

Last Answer : B. compress data by using fewer bits to encode more frequently occuring characters

The UNIX compress command is one of the earlier applications of a. LZ77 b. LZ78 c. Huffman d. LZW

Description : The UNIX compress command is one of the earlier applications of a. LZ77 b. LZ78 c. Huffman d. LZW

Last Answer : d. LZW

If the probability is not given which method is preferable a. Huffman b. Non Binary Huffman c. Adaptive Huffman d. Extended Huffman

Description : If the probability is not given which method is preferable a. Huffman b. Non Binary Huffman c. Adaptive Huffman d. Extended Huffman

Last Answer : c. Adaptive Huffman

The basic idea behind Huffman coding is to a. compress data by using fewer bits to encode fewer frequently occuring characters b. compress data by using fewer bits to encode more frequently occuring characters c. compress data by using more bits to encode more frequently occuring characters d. expand data by using fewer bits to encode more frequently occuring characters

Description : The basic idea behind Huffman coding is to a. compress data by using fewer bits to encode fewer frequently occuring characters b. compress data by using fewer bits to encode more ... frequently occuring characters d. expand data by using fewer bits to encode more frequently occuring characters

Last Answer : b. compress data by using fewer bits to encode more frequently occuring characters

___________has become quite popular for encoding all kinds of images, both computer-generated and “natural” images. a. GIF b. PNG c. TIFF d. JPEG

Description : ___________has become quite popular for encoding all kinds of images, both computer-generated and “natural” images. a. GIF b. PNG c. TIFF d. JPEG

Last Answer : a. GIF

The process by which a sender transmits content is known as (a) Encoding ; (b) Decoding ; (c) Feedback ; (d) Receiver

Description : The process by which a sender transmits content is known as (a) Encoding ; (b) Decoding ; (c) Feedback ; (d) Receiver

Last Answer : (a) Encoding ;

Fax is: A. Facsimile Decoding B. Facsimile Encoding C. Factual Encoding. D. Factual Decoding

Description : Fax is: A. Facsimile Decoding B. Facsimile Encoding C. Factual Encoding. D. Factual Decoding

Last Answer : B. Facsimile Encoding

The correct encoding of the letter C in this tree is... A. 11 B. 10 C. 01 D. 00

Description : The correct encoding of the letter C in this tree is... A. 11 B. 10 C. 01 D. 00

Last Answer : C. 01

When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Description : When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Last Answer : A. When we want to compress patterns of data

When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Description : When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Last Answer : A. When we want to compress patterns of data

What process is done by the data compression while encoding the data ? a) Identifying repetition in the data b) Reducing repetition in the data c) Eliminating repetition in the data d) All of these

Description : What process is done by the data compression while encoding the data ? a) Identifying repetition in the data b) Reducing repetition in the data c) Eliminating repetition in the data d) All of these

Last Answer : d) All of these

Run length encoding is a compression method in which repeated ______ of a symbol are replaced. a. Residual b. Occurrence c. Letters d. None

Description : Run length encoding is a compression method in which repeated ______ of a symbol are replaced. a. Residual b. Occurrence c. Letters d. None

Last Answer : b. Occurrence

ECE Board Exam March 1996 Communications code is ____________. A. eight bits per character B. agreed upon in advance between sender and receiver C. the same in all modern computers D. either seven or eight bits per character

Description : ECE Board Exam March 1996 Communications code is ____________. A. eight bits per character B. agreed upon in advance between sender and receiver C. the same in all modern computers D. either seven or eight bits per character

Last Answer : B. agreed upon in advance between sender and receiver

Codes must be A. agreed upon in advance between sender and receiver B. eight bit per character C. the same in all modern computer D. either seven or eighth bits per character

Description : Codes must be A. agreed upon in advance between sender and receiver B. eight bit per character C. the same in all modern computer D. either seven or eighth bits per character

Last Answer : A. agreed upon in advance between sender and receiver

Symmetric - key cryptography refers to ______methods in which both the sender and receiver share the same key ( or , less commonly, in which their keys are different but related in an easily computable way): a) Encryption b) Decryption c) Both of above d) None of These

Description : Symmetric - key cryptography refers to ______methods in which both the sender and receiver share the same key ( or , less commonly, in which their keys are different but related in an easily computable way): a) Encryption b) Decryption c) Both of above d) None of These

Last Answer : a) Encryption

Symmetric - key cryptography refers to ______methods in which both the sender and receiver share the same key ( or , less commonly, in which their keys are different but related in an easily computable way): a) Encryption b) Decryption c) Both of above d) None of These

Description : Symmetric - key cryptography refers to ______methods in which both the sender and receiver share the same key ( or , less commonly, in which their keys are different but related in an easily computable way): a) Encryption b) Decryption c) Both of above d) None of These

Last Answer : a) Encryption

The binary code for each pixel is used to determine A. Which colour will be displayed B. How big the image is C. What shape the image is D. How many pixels will be in the image

Description : The binary code for each pixel is used to determine A. Which colour will be displayed B. How big the image is C. What shape the image is D. How many pixels will be in the image

Last Answer : A. Which colour will be displayed

Code {0,01,11,111} is UDC. a. True b. False

Description : Code {0,01,11,111} is UDC. a. True b. False

Last Answer : b. False

Code {0,10,100,111} is : a. UDC b. Prefix code c. Instantaneous code d. All above

Description : Code {0,10,100,111} is : a. UDC b. Prefix code c. Instantaneous code d. All above

Last Answer : d. All above

ASCII Code is a example of a. Prefix code b. Variable length code c. Fixed length code d. Alphanumeric code

Description : ASCII Code is a example of a. Prefix code b. Variable length code c. Fixed length code d. Alphanumeric code

Last Answer : c. Fixed length code

The distance of the pointer from the look-ahead buffer is called : a. Length b. Offset c. Triplet d. Code

Description : The distance of the pointer from the look-ahead buffer is called : a. Length b. Offset c. Triplet d. Code

Last Answer : b. Offset

Sequence of code assigned is called a. A. code word b. B. word c. C. byte d. D. nibble

Description : Sequence of code assigned is called a. A. code word b. B. word c. C. byte d. D. nibble

Last Answer : a. A. code word

The act of changing the background color of a publication on which the image displays does not make the image look different. A. Color Depth B. Compression C. Portability D. Transparency

Description : The act of changing the background color of a publication on which the image displays does not make the image look different. A. Color Depth B. Compression C. Portability D. Transparency

Last Answer : D. Transparency

Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender? (A) Broadcasting (B) Unicasting (C) Packet Switching (D) Circuit Switching

Description : Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender? (A) Broadcasting (B) Unicasting (C) Packet Switching (D) Circuit Switching

Last Answer : (D) Circuit Switching

Which of the following is a benefit of lossy compression over lossless? A. File sizes will always be reduced, even when compressed multiple times. B. File quality is not harmed, e.g. images will look exactly the same. C. Files can be decompressed back to their original uncompressed form. D. File sizes are usually significantly smaller.

Description : Which of the following is a benefit of lossy compression over lossless? A. File sizes will always be reduced, even when compressed multiple times. B. File quality is not harmed, e.g. ... can be decompressed back to their original uncompressed form. D. File sizes are usually significantly smaller.

Last Answer : C. Files can be decompressed back to their original uncompressed form.

A wave in which the wave’s medium is compressed in the same direction as the movement of the wave A. Transversal wave B. Transverse wave C. Frequency wave D. compression wave

Description : A wave in which the wave’s medium is compressed in the same direction as the movement of the wave A. Transversal wave B. Transverse wave C. Frequency wave D. compression wave

Last Answer : C. Frequency wave

Which best describes Lossless Compression? A. No information is lost but file size is increased B. There is no loss in information at all after compression C. Files which have the exact same data after compression D. Compression that involves an algorithm

Description : Which best describes Lossless Compression? A. No information is lost but file size is increased B. There is no loss in information at all after compression C. Files which have the exact same data after compression D. Compression that involves an algorithm

Last Answer : B. There is no loss in information at all after compression

The term 'duplex' refers to theability of the data receiving stations toecho back aconfirming messageto the sender. Infull duplex data transmission, both the sender and the receiver A. cannot talk at once B. can receive and send datasimultaneously C. can sendor receive data one ata time D. can do one way data transmission only E. None of the above

Description : The term 'duplex' refers to theability of the data receiving stations toecho back aconfirming messageto the sender. Infull duplex data transmission, both the sender and the receiver A. cannot talk at once B. can ... data one ata time D. can do one way data transmission only E. None of the above

Last Answer : can do one way data transmission only

The Post Office Protocol is an ………... protocol with both client (sender/receiver) and …………...functions A. electronic mail, server (storage) B. three layer , server C. UDP, transfer D. TCP, server

Description : The Post Office Protocol is an ………... protocol with both client (sender/receiver) and …………...functions A. electronic mail, server (storage) B. three layer , server C. UDP, transfer D. TCP, server

Last Answer : A. electronic mail, server (storage)

In the multimedia contents, which process is done by a software ? a) Conversion (coding) b) Reverse conversion c) (A) and (B) both d) None of these

Description : In the multimedia contents, which process is done by a software ? a) Conversion (coding) b) Reverse conversion c) (A) and (B) both d) None of these

Last Answer : c) (A) and (B) both

To convert multimedia information coming from hardware devices into computer data can be compared with which process ? a) Coding b) Decoding c) (a) and (b) both d) None of these

Description : To convert multimedia information coming from hardware devices into computer data can be compared with which process ? a) Coding b) Decoding c) (a) and (b) both d) None of these

Last Answer : a) Coding

From the following, which option shows an issue faced with multimedia contents ? a) Converting multimedia information coming from hardware devices into computer data b) converting the computer data back into audio/video streams for playing on the hardware device c) a and b both d) None of these

Description : From the following, which option shows an issue faced with multimedia contents ? a) Converting multimedia information coming from hardware devices into computer data b) converting the computer data back into audio/ ... for playing on the hardware device c) a and b both d) None of these

Last Answer : c) a and b both

Entropy of a source is a. Self information of the source b. Average self information c. Average number of bits d. Both (a) and (b)

Description : Entropy of a source is a. Self information of the source b. Average self information c. Average number of bits d. Both (a) and (b)

Last Answer : b. Average self information