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
After learning this, you will be able to: understand the concept of algorithm; understand mathematical foundation underlying the analysis of algorithm; to understand se

Encryption the plain-text using the round keys: 1. (Key schedule) Implement an algorithm that will take a 128 bit key and generate the round keys for the AES encryption/decryp

Adjacency list representation An Adjacency list representation of Graph G = {V, E} contains an array of adjacency lists mentioned by adj of V list. For each of the vertex u?V,

Write an algorithm for searching a key from a sorted list using binary search technique 1.   if (low > high) 2.     return (-1) 3.    mid = (low +high)/2; 4    .if ( X

In this respect depth-first search (DFS) is the exact reverse process: whenever it sends a new node, it immediately continues to extend from it. It sends back to previously explore

Linked list representations contain great advantages of flexibility on the contiguous representation of data structures. However, they contain few disadvantages also. Data structur

important points on asymptotic notation to remember

How memory is freed using Boundary tag method in the context of Dynamic memory management? Boundary Tag Method to free Memory To delete an arbitrary block from the free li

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

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,