Question 31
Question 32
Consider the recurrence relation: Where b and c are constants. The order of the algorithm corresponding to above recurrence relation is:
Question 33
A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:
Question 34
Question 35
Question 36
Question 37
Question 38
Question 39
Question 40
There are 74 questions to complete.