[discussion_vu] SOLUTION REQUIRED

ANY BODY HELP ME ABOUT THE BELOW MENTIONED ASSIGNMENTS

 

ASSIGNMENT 01

Develop a complete program that inputs a text file, and compresses it using Huffman algorithm.

Requirements

1. Read a file input.txt
2. Count frequency of all alphabets/symbols and store in frequency table
3. Allocate TreeNodes from all symbols and their frequencies.
4. Add all TreeNodes to MinPQ.
5. Run the loop to construct Huffman Tree, until MinPQ returns only one element.
6. Store last single element as Root.
7. Find BINARY code of each alphabet from Huffman tree traversal and store in codes array.
8. Using Huffman  codes,  compress the contents of input file.
9. Write the compressed file output.txt
10. Save the Huffman tree in another file codes.txt
11. Using codes.txt, read the output.txt again and decompress it.
12. Compare the original file and uncompressed file for any differences.

ASSIGNMENT 02

 

We know that all types of expressions and precedence cases cannot be handled by stack based postfix converter and evaluator.

 

·         Develop an expression evaluator that parses an infix expression and generates a (Parse-Tree) Expression Tree.

The tree should also be visible on display.

 

·         Develop an expression solver that traverses the expression tree and solves the expression.

Following cases should be handled.

 

1.      Unary, Binary and ternary operators..

2.      Multi-Character operators (++, = = , >=) etc

3.      Float numbers

4.      All types of brackets

5.      Infix functions  like sin(x), etc

6.      All or most exceptional cases (that will be discussed in class and added in assignment later)

--
You received this message because you are subscribed to the Google Groups "Virtual University of Pakistan" group.
To post to this group, send email to discussion_vu@googlegroups.com.
To unsubscribe from this group, send email to discussion_vu+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/discussion_vu?hl=en.