retagged by
287 views

1 Answer

1 votes
1 votes

<f1,f2,f3,f4,f5,f6,f7>={10,8,3,15,12,5,20>

Construct Huffman tree,find the cost of tree it is equall to no of record movements.

In huffman tree select any two small trees from forest and add  them(new tree).Delete small two trees and add resulting tree to forest.Continue this procedure until forest becomes single tree.

 Add all internal nodes this gives the cost of tree=73+31+42+16+8+22=192.

Hence total no of record movements=192.