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. Using the following given inorder and preorder traversal reconstruct a binary tree Inorder sequence is D, G, B, H, E, A, F, I, C

Explain about greedy technique The  greedy  method  suggests  constructing  a   solution  to  an  optimization  problem   by  a sequence of steps, every expanding a partially c

It does not have any cycles (circuits, or closed paths), which would imply the existence of more than one path among two nodes. It is the most general kind of tree, and might be co

what are registers? why we need register? Definition? Types? What registers can do for us?

A graph with n vertices will absolutely have a parallel edge or self loop if the total number of edges is greater than n-1

Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.

Write an algorithm for binary search. What are its limitations? .

HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENTS IN LINKED LIST?

Example of pre order traversal: Reading of a book, since we do not read next chapter unless we complete all sections of previous chapter & all its sections. Figure  : Rea

Limitation of Binary Search: - (i)  The complexity of Binary search is O (log2 n). The complexity is similar irrespective of the position of the element, even if it is not pres