CCN exam 1 questions with complete
solutions
Order these message from most amount of information (3) to least amount of information (1).
Your best friend will win 10,000 dollars in Vegas this year.
Your best friend will win 100 dollars in Vegas this year.
The sun will rise tomorrow. - ANSWERS3, 2, 1
How many unique messages can be sent if you are limited to 3 symbols where each symbol can
take on 4 different values? This represents the size of the message space (i.e. the set of possible
messages). - ANSWERS64
Calculate the information in bits associated with the event:
Two flips of a fair coin resulting in heads then tails. - ANSWERS2
Calculate the entropy associated with drawing balls with replacement from a bag assuming the
following occurred:
Color Occurrence p*log2(1/p)
Blue 10
Red 20 - ANSWERS.918
How many bits of information are contained in the message "Pa$$w0rD" if we assume each
symbol represents up to 74 unique possibilities? Hint - the " marks are not part of the message.
- ANSWERS50
,Suppose you were asking someone a series of yes/no/maybe questions (i.e. they can respond
yes, no, maybe). What is the potential message space (i.e. number of unique possible
responses) if you ask 6 questions? - ANSWERS729
Calculate the information in bits associated with the event:
The flipping of a weighted coin resulting in heads (probability(H) = 25/100). - ANSWERS2
Calculate the information in bits associated with the event:
The flipping of a weighted coin resulting in heads (probability(H) = 75/100). - ANSWERS.415
Calculate the information in bits associated with the event:
The flipping of a fair coin resulting in heads. - ANSWERS1
Calculate the entropy associated with drawing balls with replacement from a bag assuming the
following occurred:
Color Occurrence p*log2(1/p)
Blue 10
Red 40 - ANSWERS.721
_____measure of surprise
____limit of compression
_____variable length
_____uncompressed/compressed
_____unit of information
1. bit
2. entropy
3. Huffman encoding
, 4. Compression ratio
5. Information - ANSWERS5,2,3,4,1
Alice is trying to send a long message to Bob using the fewest bits of information possible. Since
there are so few "j"s in the message she decides to replace them with "i"s before running her
message through the normal text compression engine. This is an example of _____________
compression. - ANSWERSlossy
Symb Freq prob code bits/symbol weighted mean
A 70 .7 1
B 15 .15 01
C 10 .1 001
D 5 .05 000
What is the entropy of the underlying message? - ANSWERS1.319
What is the entropy of drawing balls from a bag with replacement assuming the following
occurred:
Color Occurrence p*log2(1/p)
Brown 15
Red 25
Orange 100-15-25
For the Orange the Occurence number is 100 minus the two numbers (e.g. 100 - 15 -25 = 60).
The limitations of D2L prevent me from displaying the result. - ANSWERS1.353
Symb Freq prob code bits/symbol weighted mean
A 70 .7 1
B 15 .15 01
C 10 .1 001
solutions
Order these message from most amount of information (3) to least amount of information (1).
Your best friend will win 10,000 dollars in Vegas this year.
Your best friend will win 100 dollars in Vegas this year.
The sun will rise tomorrow. - ANSWERS3, 2, 1
How many unique messages can be sent if you are limited to 3 symbols where each symbol can
take on 4 different values? This represents the size of the message space (i.e. the set of possible
messages). - ANSWERS64
Calculate the information in bits associated with the event:
Two flips of a fair coin resulting in heads then tails. - ANSWERS2
Calculate the entropy associated with drawing balls with replacement from a bag assuming the
following occurred:
Color Occurrence p*log2(1/p)
Blue 10
Red 20 - ANSWERS.918
How many bits of information are contained in the message "Pa$$w0rD" if we assume each
symbol represents up to 74 unique possibilities? Hint - the " marks are not part of the message.
- ANSWERS50
,Suppose you were asking someone a series of yes/no/maybe questions (i.e. they can respond
yes, no, maybe). What is the potential message space (i.e. number of unique possible
responses) if you ask 6 questions? - ANSWERS729
Calculate the information in bits associated with the event:
The flipping of a weighted coin resulting in heads (probability(H) = 25/100). - ANSWERS2
Calculate the information in bits associated with the event:
The flipping of a weighted coin resulting in heads (probability(H) = 75/100). - ANSWERS.415
Calculate the information in bits associated with the event:
The flipping of a fair coin resulting in heads. - ANSWERS1
Calculate the entropy associated with drawing balls with replacement from a bag assuming the
following occurred:
Color Occurrence p*log2(1/p)
Blue 10
Red 40 - ANSWERS.721
_____measure of surprise
____limit of compression
_____variable length
_____uncompressed/compressed
_____unit of information
1. bit
2. entropy
3. Huffman encoding
, 4. Compression ratio
5. Information - ANSWERS5,2,3,4,1
Alice is trying to send a long message to Bob using the fewest bits of information possible. Since
there are so few "j"s in the message she decides to replace them with "i"s before running her
message through the normal text compression engine. This is an example of _____________
compression. - ANSWERSlossy
Symb Freq prob code bits/symbol weighted mean
A 70 .7 1
B 15 .15 01
C 10 .1 001
D 5 .05 000
What is the entropy of the underlying message? - ANSWERS1.319
What is the entropy of drawing balls from a bag with replacement assuming the following
occurred:
Color Occurrence p*log2(1/p)
Brown 15
Red 25
Orange 100-15-25
For the Orange the Occurence number is 100 minus the two numbers (e.g. 100 - 15 -25 = 60).
The limitations of D2L prevent me from displaying the result. - ANSWERS1.353
Symb Freq prob code bits/symbol weighted mean
A 70 .7 1
B 15 .15 01
C 10 .1 001
