retagged by
3,463 views
3 votes
3 votes

Is there any difference in between draw tree for huffman coding and optimal merge pattern if yes please give detailed explanation.

retagged by

2 Answers

0 votes
0 votes
there is no difference b/w huffman coading and optimal merge pattern. both are working as same .

the answer of the above question will be 140

Related questions

0 votes
0 votes
2 answers
1
2 votes
2 votes
1 answer
2
VIKAS TIWARI asked Dec 13, 2017
3,821 views
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
2 votes
2 votes
2 answers
3
Ali Jazib Mahmood asked Aug 18, 2017
1,340 views
To merge 2 files of size m and n it takes m + n time What will be the optimal time Complexity to merge the files of size 10, 15, 40, 70, 75 and 80?
0 votes
0 votes
3 answers
4
Deeptimittal97 asked Jul 6, 2017
10,067 views
What will be the time complexity to obtain optimal merge pattern to merge files using greedy technique?