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
Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre

Ask question #Minimum 10000 words accepted#

Need help with Data Structures assignment requiring C++ program

State about the pre- and post conditions Programmers can easily document other pre- and post conditions and class invariants, though, and insert code to check most value preco

Example of Area Subdivision Method The procedure will be explained with respect to an illustrative problem, with the image consisting of five objects, namely a triangle (T), qu

What is AVL Tree? Describe the method of Deletion of a node from and AVL Tree ?

Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val

Binary Space Partition A binary space-partitioning (BSP) tree is an efficient method for determining object visibility by painting surfaces onto the screen from back to front,

With the help of a program and a numerical example explain the Depth First Traversal of a tree.

Define Merge Sort  Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two ha