Approximately how much bigger (how many more bytes) is a megabyte than a kilobyte? A. 1000 times bigger B. 10,0000 times bigger C. 1,000,000,000 times bigger D. 100,000 times bigger

Approximately how much bigger (how many more bytes) is a megabyte  than a kilobyte?
A. 1000 times bigger
B. 10,0000 times bigger
C. 1,000,000,000 times bigger
D. 100,000 times bigger
by

1 Answer

Answer :

D. 100,000 times bigger
by

Related questions

Select the answer that lists the units of bytes in ascending order (from smallest to largest) A. gigabyte, megabyte, terabyte B. megabyte, terabyte, kilobyte C. gigabyte, terabyte, megabyte D. kilobyte, gigabyte, terabyte

Description : Select the answer that lists the units of bytes in ascending order (from smallest to largest) A. gigabyte, megabyte, terabyte B. megabyte, terabyte, kilobyte C. gigabyte, terabyte, megabyte D. kilobyte, gigabyte, terabyte

Last Answer : A. gigabyte, megabyte, terabyte

One megabyte equals approximately 1) 1,000 bits 2) 1,000 bytes 3) 1 million bytes 4) 1 million bits 5) 2,000 bytes

Description : One megabyte equals approximately 1) 1,000 bits 2) 1,000 bytes 3) 1 million bytes 4) 1 million bits 5) 2,000 bytes

Last Answer : Answer :3

In computer language, one kilobyte equals 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 8 bytes

Description : In computer language, one kilobyte equals 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 8 bytes

Last Answer : 2) 1024 bytes

One kilobyte is equal to 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 1023 bytes

Description : One kilobyte is equal to 1) 1000 bytes 2) 1024 bytes 3) 100 bytes 4) 1023 bytes

Last Answer : 2) 1024 bytes

Kilobyte equals to how many bytes? A. 1000 B. 1064 C. 1024 D. None of the above

Description : Kilobyte equals to how many bytes? A. 1000 B. 1064 C. 1024 D. None of the above

Last Answer : C. 1024

1 Kilobyte (KB) is _______: a) 1000 bits b) 1 Kilo KB c) Both (a) and (b) d) 1024 Bytes e) None of The Above

Description : 1 Kilobyte (KB) is _______: a) 1000 bits b) 1 Kilo KB c) Both (a) and (b) d) 1024 Bytes e) None of The Above

Last Answer : d) 1024 Bytes

Which of the following represents one billion characters? (A) Terabyte (B) Kilobyte (C) Megabyte (D) Gigabyte

Description : Which of the following represents one billion characters? (A) Terabyte (B) Kilobyte (C) Megabyte (D) Gigabyte

Last Answer : Answer: D Explanation: One million=1,000,000 one billion=1,000,000,000=10003 1 byte may hold 1 character 1000 bytes=1 kilobyte 10002 bytes=1 megabyte 10003 bytes=1 gigabyte

Which is the largest unit of storage among the following? (A) Terabyte (B) Megabyte (C) Kilobyte (D) Gigabyte

Description : Which is the largest unit of storage among the following? (A) Terabyte (B) Megabyte (C) Kilobyte (D) Gigabyte

Last Answer : (A) Terabyte

Which measure of memory is the largest ? (1) MB Megabyte (2) GB Gigabyte (3) TB Terabyte (4) KB Kilobyte

Description : Which measure of memory is the largest ? (1) MB Megabyte (2) GB Gigabyte (3) TB Terabyte (4) KB Kilobyte

Last Answer : TB Terabyte

One Gigabyte is Approximately equal is 1) 1000,000 bytes 2) 1000,000,000 bytes 3) 1000,000,000,000 bytes 4) None of these

Description : One Gigabyte is Approximately equal is 1) 1000,000 bytes 2) 1000,000,000 bytes 3) 1000,000,000,000 bytes 4) None of these

Last Answer : 2) 1000,000,000 bytes

An Image is Square array of 256X256 pixel requires 65536 bytes, and after compression it reduced to 16384 X8 bytes. What will be the compression rate: a. 2 b. 3 c. 4 d. 5

Description : An Image is Square array of 256X256 pixel requires 65536 bytes, and after compression it reduced to 16384 X8 bytes. What will be the compression rate: a. 2 b. 3 c. 4 d. 5

Last Answer : a. 2

How many bytes equal to 1 megabyte ?

Last Answer : 1 megabyte equals 1024 x 1024 bytes.

How many bytes is in a kilobyte (KB)? -General Knowledge

Description : How many bytes is in a kilobyte (KB)? -General Knowledge

Last Answer : answer:

How many bytes equal to 1 kilobyte ?

Last Answer : 1 kilobyte equals 1024 bytes.

1 kilobyte = how many bytes ?

Last Answer : 1 kilobyte = 1024 bytes.

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

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

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

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

An IP datagram of size 1000 bytes arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is 100 bytes. Assume that the size of the IP header is 20 bytes. The number of fragments that the IP datagram will be divided into for transmission is : a. 10 b. 50 c. 12 d. 13

Description : An IP datagram of size 1000 bytes arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is 100 bytes. Assume that the size of the IP header is 20 bytes ... the IP datagram will be divided into for transmission is : a. 10 b. 50 c. 12 d. 13

Last Answer : d. 13

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.

What are the main reasons to compress data? A. To reduce secondary storage space B. To maximise the available RAM memory C. To speed up network transmission times D. To optimise the data

Description : What are the main reasons to compress data? A. To reduce secondary storage space B. To maximise the available RAM memory C. To speed up network transmission times D. To optimise the data

Last Answer : A. To reduce secondary storage space

Which binary value equals 20? 72) A) 0100 B) 0001 C) 1000 D) 0000

Description : Which binary value equals 20? 72) A) 0100 B) 0001 C) 1000 D) 0000

Last Answer : B) 0001

Which binary value equals 2-3? 69) A) 0011.1000 B) 0000.0010 C) 0000.0100 D) 0000.0011

Description : Which binary value equals 2-3? 69) A) 0011.1000 B) 0000.0010 C) 0000.0100 D) 0000.0011

Last Answer : B) 0000.0010

Which binary value equals 2-1? 61) A) 1.0000 B) 0.0010 C) 0.0001 D) 0.1000

Description : Which binary value equals 2-1? 61) A) 1.0000 B) 0.0010 C) 0.0001 D) 0.1000

Last Answer : D) 0.1000

Which binary value equals 2-2? 13) A) 0000.0010 B) 0010.0000 C) 0000.1000 D) 0000.010

Description : Which binary value equals 2-2? 13) A) 0000.0010 B) 0010.0000 C) 0000.1000 D) 0000.010

Last Answer : D) 0000.010

What is the Result of RR A instruction if accumulator contains 1000 0000. a) 0000 0001 b) 0000 0000 c) 0100 0000 d) 0000 0010

Description : What is the Result of RR A instruction if accumulator contains 1000 0000. a) 0000 0001 b) 0000 0000 c) 0100 0000 d) 0000 0010

Last Answer : a) 0000 0001

What is the frequency range of an aircraft’s Very High Frequency (VHF) communications? A. 118.000 MHz to 136.975 MHz (worldwide up to 151.975 MHz) B. 108.000 MHz to 117.95 MHz C. 329.15 MHz to 335.00 MHz D. 2.0000 MHz to 29.999 MHz

Description : What is the frequency range of an aircraft’s Very High Frequency (VHF) communications? A. 118.000 MHz to 136.975 MHz (worldwide up to 151.975 MHz) B. 108.000 MHz to 117.95 MHz C. 329.15 MHz to 335.00 MHz D. 2.0000 MHz to 29.999 MHz

Last Answer : A. 118.000 MHz to 136.975 MHz (worldwide up to 151.975 MHz)

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

A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one-way propagation delay is 100 milliseconds. Assuming no frame is lost, the sender throughput is __________ bytes/second. a. 2500 b. 2000 c. 1500 d. 500

Description : A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of ... is lost, the sender throughput is __________ bytes/second. a. 2500 b. 2000 c. 1500 d. 500

Last Answer : a. 2500

A disk has 500 bytes/sector,100 sectors / track, 20 heads and 1000 cylinders. Total capacity of disk is

Description : A disk has 500 bytes/sector,100 sectors / track, 20 heads and 1000 cylinders. Total capacity of disk is  (a) 1 GB (b) 100 MB (c) 10 MB (d) 10 GB

Last Answer : A disk has 500 bytes/sector,100 sectors / track, 20 heads and 1000 cylinders. Total capacity of disk is 1 GB

If an antenna has a gain of 3 dB, it increases the output of the transmitter by A. 10,000 times B. 1000 times C. 100 times D. 1 million times

Description : If an antenna has a gain of 3 dB, it increases the output of the transmitter by A. 10,000 times B. 1000 times C. 100 times D. 1 million times

Last Answer : B. 1000 times

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

The process of representing Infinite set of values with a much smaller set is called a. Mapping b. clustering c. Quantization d. Sampling

Description : The process of representing Infinite set of values with a much smaller set is called a. Mapping b. clustering c. Quantization d. Sampling

Last Answer : c. Quantization

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

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

How does lossy compression reduce the size of files? A. Through removing redundancies by grouping repeated data together. B. By removing some precision in data that humans would have difficulty to perceive. C. By grouping files into a single folder, thus reducing the amount of storage needed. D. By replacing blocks of data with more compact representations.

Description : How does lossy compression reduce the size of files? A. Through removing redundancies by grouping repeated data together. B. By removing some precision in data that humans would have difficulty to ... the amount of storage needed. D. By replacing blocks of data with more compact representations.

Last Answer : D. By replacing blocks of data with more compact representations.

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

Approximately how many Galaxies are there ? A. 10 Billion Galaxies B. 100 Billion Galaxies (Answer) C. 1000 Billion Galaxies D. 10000 Billion Galaxies

Description : Approximately how many Galaxies are there ? A. 10 Billion Galaxies B. 100 Billion Galaxies (Answer) C. 1000 Billion Galaxies D. 10000 Billion Galaxies

Last Answer : B. 100 Billion Galaxies (Answer)

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

What does 'WYSIWYG' stand for? A. Why you see is why you get B. When you see is when you get C. What you see is what you get D. Where you see is where you get

Description : What does 'WYSIWYG' stand for? A. Why you see is why you get B. When you see is when you get C. What you see is what you get D. Where you see is where you get

Last Answer : D. Where you see is where you get