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

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

1 Answer

Answer :

b. Skewed probability
by

Related questions

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

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

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

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

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)

Description : 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)

Last Answer : a. Same

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

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

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

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

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

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

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

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

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

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

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

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

In dictionary techniques for data compaction, which approach of building dictionary is used for the prior knowledge of probability of the frequently occurring patterns? a. Static Dictionary b. Adaptive Dictionary c. both a and b d. None of the above

Description : In dictionary techniques for data compaction, which approach of building dictionary is used for the prior knowledge of probability of the frequently occurring patterns? a. Static Dictionary b. Adaptive Dictionary c. both a and b d. None of the above

Last Answer : a. Static Dictionary

Probability model is based on a. Probability b. Physics c. Frequency d. None

Description : Probability model is based on a. Probability b. Physics c. Frequency d. None

Last Answer : c. Frequency

If the P(E) = 1, it means event a. does not occur b. always occur c. no probability d. Normalization

Description : If the P(E) = 1, it means event a. does not occur b. always occur c. no probability d. Normalization

Last Answer : b. always occur

Normal Probability Curve should be (A) Positively skewed (B) Negatively skewed (C) Leptokurtic skewed (D) Zero skewed

Description : Normal Probability Curve should be (A) Positively skewed (B) Negatively skewed (C) Leptokurtic skewed (D) Zero skewed 

Last Answer : (D) Zero skewed

Hamzah needs to email a large file to a classmate. Why might he need to use file compression to do so? A. Email services often only let you send compressed data files. B. Compressed files are less likely to become corrupted when being transferred via email. C. He won't need to. All email providers let you send any files you like, regardless of size. D. Email services often have maximum file sizes that prevent you sending files that are too large.

Description : Hamzah needs to email a large file to a classmate. Why might he need to use file compression to do so? A. Email services often only let you send compressed data files. B. Compressed files are ... . D. Email services often have maximum file sizes that prevent you sending files that are too large.

Last Answer : D. Email services often have maximum file sizes that prevent you sending files that are too large.

A programmer is writing a system that is intended to be able to store large amounts of personal data. As the programmer develops the data system, which of the following is LEAST likely to impact the programmer’s choices in designing the structure of the system? A. Maintaining privacy of the information stored in the data set. B. Scalability of the system. C. Structuring the metadata of the information for analysis. D. The frequency of a particular item occurring in a data set.

Description : A programmer is writing a system that is intended to be able to store large amounts of personal data. As the programmer develops the data system, which of the following is LEAST likely to impact the ... of the information for analysis. D. The frequency of a particular item occurring in a data set.

Last Answer : D. The frequency of a particular item occurring in a data set.

Which of these statements highlights a valid privacy concern when working with large data sets? I. Data from multiple sources could be linked together to discover someone’s identity. II. For access to location-based services, a user needs to reveal location and identity. III. CAPTCHA is a popular crowdsourcing technique that can be used to sense if the user is human. A. I and II only B. I only C. I and III only D. I, II and III

Description : Which of these statements highlights a valid privacy concern when working with large data sets? I. Data from multiple sources could be linked together to discover someone's identity. II. For access to location-based services, a ... . I and II only B. I only C. I and III only D. I, II and III

Last Answer : B. I only

The process of representing a large—possibly infinite—set of values with a much smaller set is called______________. A. Linear function Quantization B. PDF. C. CDF D. Quantization

Description : The process of representing a large—possibly infinite—set of values with a much smaller set is called______________. A. Linear function Quantization B. PDF. C. CDF D. Quantization

Last Answer : D. Quantization

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

Window in dictionary method consists of ___________ parts a. 1 b. 3 c. 2 d. 4

Description : Window in dictionary method consists of ___________ parts a. 1 b. 3 c. 2 d. 4

Last Answer : c. 2

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

The design of the _____has a significant impact on the amount of compression. a. Cluster b. Quantizer c. Codebook d. Both (b) and (a)

Description : The design of the _____has a significant impact on the amount of compression. a. Cluster b. Quantizer c. Codebook d. Both (b) and (a)

Last Answer : b. Quantizer

At any given time, the output of an encoder depends on ______ a. Past input b. Present input c. Both a and b d. None of the above

Description : At any given time, the output of an encoder depends on ______ a. Past input b. Present input c. Both a and b d. None of the above

Last Answer : b. Present input

___________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 CALIC scheme actually functions on : a. bi-level images. b. gray-scale images c. RBG images d. Both (a) and (b)

Description : The CALIC scheme actually functions on : a. bi-level images. b. gray-scale images c. RBG images d. Both (a) and (b)

Last Answer : d. Both (a) and (b)

How many character an encoder reads and searches the dictionary to see if this input exists in the dictionary. a. 2 character b. 1 character c. 3 character d. Both (a) and (b)

Description : How many character an encoder reads and searches the dictionary to see if this input exists in the dictionary. a. 2 character b. 1 character c. 3 character d. Both (a) and (b)

Last Answer : a. 2 character

Dictionary order is sometimes used as a synonym for: a. Alphabetical order b. Lexicographical order c. Alphanumerical order d. Both (a) and (c)

Description : Dictionary order is sometimes used as a synonym for: a. Alphabetical order b. Lexicographical order c. Alphanumerical order d. Both (a) and (c)

Last Answer : b. Lexicographical order

Compression is done for saving a. A. storage b. B. bandwidth c. C. money d. D. Both A and B

Description : Compression is done for saving a. A. storage b. B. bandwidth c. C. money d. D. Both A and B

Last Answer : d. D. Both A and B

Source of information depending on finite no of outputs is called a. A. markov b. B. finite memory source c. C. zero source d. D. Both A and B

Description : Source of information depending on finite no of outputs is called a. A. markov b. B. finite memory source c. C. zero source d. D. Both A and B

Last Answer : d. D. Both A and B

In an all weld tensile test, the original specimen gauge length was 50mm, and after the test the increased gauge length was 65mm, what is the elongation percentage? a) % A is 40 b) % A is 60 c) % A is 30 d) % A is 36

Description : In an all weld tensile test, the original specimen gauge length was 50mm, and after the test the increased gauge length was 65mm, what is the elongation percentage? a) % A is 40 b) % A is 60 c) % A is 30 d) % A is 36

Last Answer : c) % A is 30

To divide information among cells A. Wrap B. Split C. Lock D. Column

Description : To divide information among cells A. Wrap B. Split C. Lock D. Column

Last Answer : B. Split

To change the font size in order to display more text or other data A. Border B. Shading C. Shrink to fit D. Printing area

Description : To change the font size in order to display more text or other data A. Border B. Shading C. Shrink to fit D. Printing area

Last Answer : A. Border

To make lines of text appear on multiple lines of a cell A. Wrap B. Split C. Lock D. Column

Description : To make lines of text appear on multiple lines of a cell A. Wrap B. Split C. Lock D. Column

Last Answer : D. Column

A webpage is an example of an ........... electronic document A. Comp B. DTP C. On screen D. Online

Description : A webpage is an example of an ........... electronic document A. Comp B. DTP C. On screen D. Online

Last Answer : C. On screen

This document is designed to be viewed ........ on your tablet A. Comp B. DTP C. On screen D. Online

Description : This document is designed to be viewed ........ on your tablet A. Comp B. DTP C. On screen D. Online

Last Answer : A. Comp

A ........ is an initial document that shows where all text and graphic elements will be placed A. Comp B. DTP C. On screen D. Online

Description : A ........ is an initial document that shows where all text and graphic elements will be placed A. Comp B. DTP C. On screen D. Online

Last Answer : C. On screen