1. DATA STRUCTURES AND ALGORITHM (CSE 220)
PROJECT ON FILE ENCODING AND DECODING

2. DATA STRUCTURES CONCEPTS USED
BINARY SEARCH TREE
PRIORITY QUEUE
STACK

3. FEATURES
NON-SINGULAR-Each code symbol should be distinct from all other code symbols.
UNIQUELY DECODABLE-  No code symbol should be the prefix of another code symbol (known as the "prefix" property).
INSTATANEOUS-Decoding (data recovery) should be sequential with no dependence on the preceding symbol.
SYNCHRONIZATION-The decoding may be started anywhere within the message, with synchronization occurring after only a few errors due to missed codes.
REDUNDANCY-There should be minimal redundancy in the code.

4. REAL TIME EXAMPLES
Both the .mp3 and .jpg file formats use huffman coding at one stage of compression.
Works well for text and fax transmission

5. PROS AND CONS Fast implementations. Error resilient.
The symbol probabilities are built-in in the code.
The code tree grows exponentially when the source is extended.
Hard to use Huffman coding for extended sources / large alphabets or when the symbol probabilities are varying by time.