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

1 Answer

Answer :

B. Number of characters (including spaces) *7

Related questions

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Last Answer : d. LZW

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

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

Last Answer : c. Golomb Code

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

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

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

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

Description : Why do computers use binary? A. Because It's all the understand.... B. Because a computer is a series of switches, 1 being on and 0 being off C. Because they can't understand ASCII D. Because UNICODE doesn't work

Last Answer : A. Because It's all the understand....

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

Description : A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table:  using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Last Answer : (D) 2,24,000 bits 

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

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

Description : Which instruction are arranged as per the protocols of memory reference format of the input file in a simple ASCII sequence of integers between the range O to 99 separated by spaces without formatted text ... : a. Memory reference instruction b. Memory reference format c. Both d. None of these

Last Answer : a. Memory reference instruction

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

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%

Description : How many bits are used to represent Unicode, ASCII, UTF-16, and UTF-8 characters?

Last Answer : Ans. Unicode requires 16 bits and ASCII require 7 bits. Although the ASCII character set uses only 7 bits, it is usually represented as 8 bits. UTF-8 represents characters using 8, 16, and 18 bit patterns. UTF-16 uses 16-bit and larger bit patterns.

Description : The standard ASCII A. is version II of ASC B. is used only in US and Canada C. has 132 characters including 32 control characters D. is subset of 8-bit EBCDIC code

Last Answer : C. has 132 characters including 32 control characters

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

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

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

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

Description : A type of data used for graphics or pictures. A. Gyphs B. Numbers C. Text D. Image

Last Answer : A. Gyphs

Description : Anything on a page that is not actual text, from simple line drawings to fully active images found on the World Wide Web. A. Graphics B. Lossless C. Lossy D. Pixels

Last Answer : A. Graphics

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

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

Description : In the international standard ASCII encoding, each character needs 7 bits of storage; however, in an ASCII string one byte (8 bits) is usually used for each character. Explain why this is done?

Last Answer : Welcome to ask-public. I don’t want to do your homework for you, but I will get you started. The extra bit is called a parity bit. If you don’t know what that means, you can do some Web searching to learn more. If you are still stuck, I can explain further.

Description : The original ASCII code used…bits of each byte, reserving that last bit for error checking a. 5 b. 6 c. 7 d. 8

Last Answer : c. 7

Description : The original ASCII code used…bits of each byte, reserving that last bit for error checking a. 5 b. 6 c. 7 d. 8

Last Answer : c. 7

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

Description : What is the number of bits in ASCII code ?

Last Answer : The number of bits in ASCII code is 8.

Last Answer : The number of bits in ASCII is 7.

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

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

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

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

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

Last Answer : B. 55