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)

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)
by

1 Answer

Answer :

b. Average self information
by

Related questions

Information per source is called a. A. sampling b. B. quantization c. C. entropy d. D. normalization

Description : Information per source is called a. A. sampling b. B. quantization c. C. entropy d. D. normalization

Last Answer : c. C. entropy

The rate for a discrete source is simply the______. a. Entropy b. Loss c. Noise d. Distortion

Description : The rate for a discrete source is simply the______. a. Entropy b. Loss c. Noise d. Distortion

Last Answer : a. Entropy

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 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

Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1 a. 1.24 b. 1.22 c. 1.28 d. 1.30

Description : Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1 a. 1.24 b. 1.22 c. 1.28 d. 1.30

Last Answer : b. 1.22

Define the term 'sample rate'. A. Snapshots of sound are taken as the wave cannot be represented as a series of continuous changes. B. The number of samples taken each second C. The number of bits used per second of audio D. The number of bits available for each clip

Description : Define the term 'sample rate'. A. Snapshots of sound are taken as the wave cannot be represented as a series of continuous changes. B. The number of samples taken each second C. The number of bits used per second of audio D. The number of bits available for each clip

Last Answer : B. The number of samples taken each second

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

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

An artist makes an RGB raster image in which each pixel color is encoded with 12-bits --- 4 bits each for red, green and blue.Which of the following correctly shows the hexadecimal value for Red as a 12-bit representation A. F00 B. 00F C. FF00 D. FF0000

Description : An artist makes an RGB raster image in which each pixel color is encoded with 12-bits --- 4 bits each for red, green and blue.Which of the following correctly shows the hexadecimal value for Red as a 12-bit representation A. F00 B. 00F C. FF00 D. FF0000

Last Answer : D. FF0000

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

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 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

An Image is represented by 65536 X8 bits, and after compression it reduced to 16384 X8 bits. What will be the compression ratio: a. 55% b. 65% c. 75% d. 85%

Description : An Image is represented by 65536 X8 bits, and after compression it reduced to 16384 X8 bits. What will be the compression ratio: a. 55% b. 65% c. 75% d. 85%

Last Answer : c. 75%

Which of the following is a secondary source of sport/event information: A. Accounting records B. Demographic reports C. Computerized surveys D. Personal interviews

Description : Which of the following is a secondary source of sport/event information: A. Accounting records B. Demographic reports C. Computerized surveys D. Personal interviews

Last Answer : B. Demographic reports

A simple quantization scheme would be to represent each output of the source with the ____value closest to it. a. Codeword b. Integer c. Binary sequence d. Coordinates

Description : A simple quantization scheme would be to represent each output of the source with the ____value closest to it. a. Codeword b. Integer c. Binary sequence d. Coordinates

Last Answer : b. Integer

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

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

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

A particular way of coding information for storage in a computer file A. Raster graphic B. Vector graphic C. File format D. Layer

Description : A particular way of coding information for storage in a computer file A. Raster graphic B. Vector graphic C. File format D. Layer

Last Answer : A. Raster graphic

A sport/event organization that wants to obtain information about the population in a certain geographic location might use A. Government sources B. Primary Databases C. Personal Questionaires D. telephone surveys

Description : A sport/event organization that wants to obtain information about the population in a certain geographic location might use A. Government sources B. Primary Databases C. Personal Questionaires D. telephone surveys

Last Answer : B. Primary Databases

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 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

Which technique identify and eliminate less important information to conserve space ? a) Data compression b) Data repetition c) Data extension d) Data conservation

Description : Which technique identify and eliminate less important information to conserve space ? a) Data compression b) Data repetition c) Data extension d) Data conservation

Last Answer : a) Data compression

Information ignored the human eye is the a. A. coding redundancy b. B. spatial redundancy c. C. temporal redundancy d. D. irrelevant info

Description : Information ignored the human eye is the a. A. coding redundancy b. B. spatial redundancy c. C. temporal redundancy d. D. irrelevant info

Last Answer : d. D. irrelevant info

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

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

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

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

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

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

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

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Description : Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Last Answer : (B) 1.75 bits per symbol

A variable is A. DIM B. Console.Writeline("") C. A uniquely named storage location D. a way of holding a WHOLE number

Description : A variable is A. DIM B. Console.Writeline("") C. A uniquely named storage location D. a way of holding a WHOLE number

Last Answer : C. A uniquely named storage location

A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Description : A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Last Answer : A. Binary

Data that describes other data. For example, a digital image may include metadata that describe the size of the image, number of colors, or resolution. A. Metadata B. Emdata C. Tridata D. Perameter

Description : Data that describes other data. For example, a digital image may include metadata that describe the size of the image, number of colors, or resolution. A. Metadata B. Emdata C. Tridata D. Perameter

Last Answer : D. Perameter

The number of dots of ink or toner per inch on a printed image. A. DPI B. RGB C. CMYK

Description : The number of dots of ink or toner per inch on a printed image. A. DPI B. RGB C. CMYK

Last Answer : B. RGB

Convert the binary number 01010101 to Hex A. 44 B. 55 C. 66 D. 77

Description : Convert the binary number 01010101 to Hex A. 44 B. 55 C. 66 D. 77

Last Answer : B. 55

Convert the Hex number DA to binary. A. 11001010 B. 11011011 C. 11011010 D. 11011110

Description : Convert the Hex number DA to binary. A. 11001010 B. 11011011 C. 11011010 D. 11011110

Last Answer : C. 11011010

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

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

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 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