1.When we measure the cost of a find operation run against a Hashtable and say i

ID: 3578902 • Letter: 1

Question

1.When we measure the cost of a find operation run against a Hashtable and say it runs in O(1) that means that the find operation

2. A message was used to create the following Prefix Code Tree:

What do you know about the message used to build this Prefix Code Tree?

3.The message: AAAAABBBCD was used to create the following Huffman Tree:

How many bits will get used when this Huffman tree encodes the message: BBBBBBCCDDAAAAAAAA ?

4. The message AAAAABBBCDEEF was used to create the following Prefix Code tree:

How many bits will get used when this Prefix Code tree encodes the message: AAAAABBBCDEEF

a. will run with a cost that does not grow as n, the number of items in the hashtable, grows. C :@ v| e- @do/- c/V A) (9 @ )

1.b)will run with a cost that varies with n, the number of items in the hashtable, and grows in cost as n grows.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.