data structure

[Rana Naveed]

Build an efficient Huffman tree using the algorithm we discussed in
class from the following table

Frequency Table
character frequency Huffman code

B 2067 _ _ _ _ _ _ _
F 3397 _ _ _ _ _ _ _
J 2155 _ _ _ _ _ _ _
P 1581 _ _ _ _ _ _ _
V 1032 _ _ _ _ _ _ _
Z 497 _ _ _ _ _ _ _

A) Create a Huffman tree to determine the binary codes for each
character.

B) Fill the codes into the table above.

[Gavin Deane]

On 16 Feb, 09:50, "Rana Naveed" <[e-mail]:

Build an efficient Huffman tree using the algorithm we discussed in
class from the following table

I'm afraid I wasn't in that class so I don't know what algorithm we
discussed.

<snip homework assignment with no attempt at a solution>

Read this
http://www.parashift.com/c++-faq-lit...t.html#faq-5.2

Now, there are plenty of people here who are willing to help you with
your homework (helping you is not the same as doing it for you). Here
is how to help them help you.
http://www.parashift.com/c++-faq-lit...t.html#faq-5.8

Gavin Deane

[jamx]

On 16 feb, 10:50, "Rana Naveed" <[e-mail]:

Build an efficient Huffman tree using the algorithm we discussed in
class from the following table

Frequency Table
character frequency Huffman code

B 2067 _ _ _ _ _ _ _
F 3397 _ _ _ _ _ _ _
J 2155 _ _ _ _ _ _ _
P 1581 _ _ _ _ _ _ _
V 1032 _ _ _ _ _ _ _
Z 497 _ _ _ _ _ _ _

A) Create a Huffman tree to determine the binary codes for each
character.

B) Fill the codes into the table above.

Build an efficient program to calculate the meaning of life, the
universe and everything like discussed in the famous novell.

A) The answer must be different from 41.
B) Calculate it in less then 7,5 million years.

just couldn't resist.. ;-p

[Marcus Kwok]

Gavin Deane <de*********@hotmail.comwrote:

On 16 Feb, 09:50, "Rana Naveed" <[e-mail]:

>Build an efficient Huffman tree using the algorithm we discussed in
class from the following table

I'm afraid I wasn't in that class so I don't know what algorithm we
discussed.

Also, I didn't even see a C++ question in the OP. Maybe the OP should
try something like sci.math or comp.programming.

--
Marcus Kwok
Replace 'invalid' with 'net' to reply

[shadowman]

jamx wrote:

On 16 feb, 10:50, "Rana Naveed" <[e-mail]:

>Build an efficient Huffman tree using the algorithm we discussed in
class from the following table

Frequency Table
character frequency Huffman code

B 2067 _ _ _ _ _ _ _
F 3397 _ _ _ _ _ _ _
J 2155 _ _ _ _ _ _ _
P 1581 _ _ _ _ _ _ _
V 1032 _ _ _ _ _ _ _
Z 497 _ _ _ _ _ _ _

A) Create a Huffman tree to determine the binary codes for each
character.

B) Fill the codes into the table above.

Build an efficient program to calculate the meaning of life, the
universe and everything like discussed in the famous novell.

A) The answer must be different from 41.
B) Calculate it in less then 7,5 million years.

just couldn't resist.. ;-p

#include <iostream>

int multiplySixByNine() {
return 42;
}

int main() {
int atltuae = multiplySixByNine();
std::cout << atltuae << std::endl;
}

Note: Actual run time is system dependent, but on one system I got:
real 0m0.006s
user 0m0.002s
sys 0m0.002s