engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Algorithm Design Techniques Greedy Algorithms
Using Huffman’s algorithm to construct an optimal binary prefix code for the following letters in the table.
|
Letters |
c |
e |
i |
r |
s |
t |
x |
|
Probability |
0.11 |
0.21 |
0.16 |
0.12 |
0.15 |
0.10 |
0.14 |
The encoding of the word “text” using the above data is :
1
00001110001
2
00001001100
3
00001101110
4
00001101000