Comp basic questions

[MSharma]

If anyone is able to help with these questions please let me know and able to explain how they got the answer as well!!!

 

3. Suppose you wish to rescan the image 8 by 10 in colour and you have two possible scanner settings; one to scan 8 bit colour and a second setting to scan 16 bit colour. 8 bit colour means that the image requires1 byte per pixel in each of the three colours of red, green, blue. 16 bit colour means that the image requires 2 bytes per pixel in each of the three colours of red, green, blue.

1. How many bytes are required to store the image in 8 bit and 16 bit colour respectively?.

2. If your USB flash memory key has 16 GB of storage space. How many images can be stored on your key in 8 bit and in 16 bit colour? You may use the approximate definitions of MB and GB

3. How many different colours are represented in 8 bit colour?

4. How many different colours are represented in 16 bit colour?

 

4. A telephone book has room for a 10 million names. Each name may contain a 30 character name a 20 character address and a 10 character

telephone number. What is the minimum size of the file which can contain all the information.

 

 

5. An alien language is discovered which has only 19 characters in its alphabet. Not including upper case characters, digits, punctuation characters, or any other special characters, what is the minimum number of bits required to represent a characters of this alien alphabet?

[THX-1138]

4. A telephone book has room for a 10 million names. Each name may contain a 30 character name a 20 character address and a 10 character telephone number. What is the minimum size of the file which can contain all the information.

 

5. An alien language is discovered which has only 19 characters in its alphabet. Not including upper case characters, digits, punctuation characters, or any other special characters, what is the minimum number of bits required to represent a characters of this alien alphabet?

 

Are these trick questions?

 

Assuming not and taking the brute-force approach,

 

4. (30 + 20 + 10) * 10⁷ = 6 * 10¹⁰ bytes

 

5. 19₁₀ = 10011₂, so 5 bits per character ought to do it. You'd even have room to represent 12 additional characters.