Accept a file and form a binary tree - huffman encoding, Data Structure & Algorithms

Huffman Encoding is one of the very simple algorithms to compress data. Even though it is very old and simple , it is still widely used (eg : in few stages of JPEG, MPEG etc). In this project you will implement huffman encoding and decoding. You can read up in Wikipedia or any other tutorial. Your system should accept a file and you require to form a binary (huffman) tree for the same. During the construction of huffman tree, use the priority queue to select nodes along with smallest frequencies. Just one time you have constructed the tree, traverse the tree and create a dictionary of codewords (letter to code). Provided any new sentences, your system must show how the sentence is converted to huffman code and then decoded back to original sentence. Note that you must implement BST and Heap yourself and must not rely on any language libraries. You can use external libraries like GraphViz to display your huffman tree.

Posted Date: 3/30/2013 3:01:01 AM | Location : United States







Related Discussions:- Accept a file and form a binary tree - huffman encoding, Assignment Help, Ask Question on Accept a file and form a binary tree - huffman encoding, Get Answer, Expert's Help, Accept a file and form a binary tree - huffman encoding Discussions

Write discussion on Accept a file and form a binary tree - huffman encoding
Your posts are moderated
Related Questions
Q. Write down an algorithm to insert a node in the beginning of the linked list.                         Ans: /* structure containing a link part and link part

I am looking for assignment help on the topic Data Structures. It would be great if anyone help me.

After learning this, you will be able to: understand the concept of algorithm; understand mathematical foundation underlying the analysis of algorithm; to understand se

c++ To calculate the amount to be paid by a customer buying yummy cupcakes for his birth day party

Which sorting algorithm is easily adaptable to singly linked lists? Simple Insertion sor t is easily adabtable to singly linked list.

Searching is the procedure of looking for something: Finding one piece of data that has been stored inside a whole group of data. It is frequently the most time-consuming part of m

So far, we now have been concerned only with the representation of single stack. What happens while a data representation is required for several stacks? Let us consider an array X

What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

In the present scenario of global warming, the computer hard ware and software are also contributing for the increase in the temperature in the environment and contributing for the