huffman tree

[dan6809]

Any idea on how to create the hoffman tree, for text encoding, in labview?..Components ? sub VIs, will be apreciated

[Naïs et Jérôme LANGE]

you can go to this url :
http://www.geocities.com/SiliconValley/2151/huffman.html


"dan6809" a écrit dans le message news:
506500000008000000E6480000-1019262487000@exchange.ni.com...
> Any idea on how to create the hoffman tree, for text encoding, in
> labview?..Components ? sub VIs, will be apreciated

[mikeporter]

Because this is a project for a class you're taking I am not going to give you the answer, but I will do what I can to help you discover the answer for yourself--which after all is the point of the whole exercise.

Now, to continue the breakdown begun in our other thread, the subtask of creating the tree can itself be broken down further into two smaller jobs:

1. Create a list of each symbol used in the input file, and the number of times each symbol was used.

2. Use that list to create te tree.

Let's start with step 1. Design a subvi that reads a file, and counts the number of times each symbol (byte value) is used.

Hint: the basic value in any file is the byte. Because a byte is 8-bits the value of a byte has to between 0 and 255. In addition
, this means that there are only 256 possible values each byte in the file can have.

Write the code to do this one bit and post it. By the way when is this project due?

Mike...