The table of ascii characters is of size 128. This requires 7 bits of data. (When stored in an 8 bit byte the high bi

[answerhappygod]

The table of ascii characters is of size 128. This
requires 7 bits of data. (When stored in an 8 bit byte the
high bit is usually left 0)
If we had 3 bits of data to represent characters in a data set,
how many characters could our set contain?
Question 1 options:
7
3
9
8
4
Question 2 (1 point)
Huffman Encoding uses a variable bit length for encoding
Question 2 options:
Question 3 (1 point)
With a long string of bits representing a message encoded as
ASCII characters (e.g. 101010101010111101....), how do we know
where one character starts and one ends?
Question 3 options:
The number of bits for each character is fixed. (Usually 8 bits
per character)
Characters begin with a 1
Characters begin with a 0
There is a space between the end of one character and the start
of another.
Question 4 (2 points)
Given a message with the character frequencies of:
a 9
b 4
d 5
r 16
m 7
After completing Huffman's algorithm, which of the five
characters should be represented with the fewest number of
bits?
Question 4 options:
b
a
m
d
r
Question 5 (5 points)
Given the message:
ammmmmmbmbmambmmmmaadmdbambaadmammmabmma
Use Huffman encoding to determine the bit path for each
character
Question 5 options:
n 01
d 001
a 000
b 1
b 01
m 001
d 000
a 1
a 01
b 001
d 000
m 1
n 01
a 001
d 000
b 1
Question 6 (3 points)
For the given graph (represented as an adjacency matrix),
calculate the total cost of Minimum Spanning Tree:
Question 6 options:
90
122
80
276
Question 7 (1 point)
A minimum spanning tree for a graph with 5 vertices will always
have 4 edges.
Question 7 options: