Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Experiment-5 AIM:-To Implement Huffman Encoding Introduction

    Uploaded by

    bhk
    The document describes implementing Huffman encoding. It explains that Huffman coding assigns variable-length codes to characters based on their frequencies, constructing a binary tree from the character frequencies where the more frequent characters are placed higher in the tree. It provides pseudocode for the algorithm to build the Huffman tree from the character frequencies and assigns codes by traversing the tree. The time complexity of the algorithm is O(nlogn). It also includes sample Java code to implement Huffman encoding on a sample string.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Experiment-5 AIM:-To Implement Huffman Encoding Introduction

    Uploaded by

    bhk
    29 views5 pages
    The document describes implementing Huffman encoding. It explains that Huffman coding assigns variable-length codes to characters based on their frequencies, constructing a binary tree from the character frequencies where the more frequent characters are placed higher in the tree. It provides pseudocode for the algorithm to build the Huffman tree from the character frequencies and assigns codes by traversing the tree. The time complexity of the algorithm is O(nlogn). It also includes sample Java code to implement Huffman encoding on a sample string.

    Original Description:

    Original Title

    Jai Resume

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes implementing Huffman encoding. It explains that Huffman coding assigns variable-length codes to characters based on their frequencies, constructing a binary tree from the character frequencies where the more frequent characters are placed higher in the tree. It provides pseudocode for the algorithm to build the Huffman tree from the character frequencies and assigns codes by traversing the tree. The time complexity of the algorithm is O(nlogn). It also includes sample Java code to implement Huffman encoding on a sample string.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    29 views5 pages

    Experiment-5 AIM:-To Implement Huffman Encoding Introduction

    Uploaded by

    bhk
    The document describes implementing Huffman encoding. It explains that Huffman coding assigns variable-length codes to characters based on their frequencies, constructing a binary tree from the character frequencies where the more frequent characters are placed higher in the tree. It provides pseudocode for the algorithm to build the Huffman tree from the character frequencies and assigns codes by traversing the tree. The time complexity of the algorithm is O(nlogn). It also includes sample Java code to implement Huffman encoding on a sample string.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 5

    EXPERIMENT-5

    AIM:-To implement Huffman encoding

    Introduction:-

    Using the Huffman Coding technique, we can compress the string to a smaller size.

    Huffman coding first creates a tree using the frequencies of the character and then generates code for each
    character.

    Once the data is encoded, it has to be decoded. Decoding is done using the same tree.

    Huffman Coding prevents any ambiguity in the decoding process using the concept of prefix code ie. a
    code associated with a character should not be present in the prefix of any other code.

    Algorithm:-

    create a priority queue Q consisting of each unique character.

    sort then in ascending order of their frequencies.

    for all the unique characters:

    create a newNode

    extract minimum value from Q and assign it to leftChild of newNode

    extract minimum value from Q and assign it to rightChild of newNode

    calculate the sum of these two minimum values and assign it to the value of newNode

    insert this newNode into the tree

    return rootNode

    Analysis:-

    The time complexity for encoding each unique character based on its frequency is O(nlog n).

    Extracting minimum frequency from the priority queue takes place 2*(n-1) times and its complexity is
    O(log n). Thus the overall complexity is O(nlog n).

    Source Code:-

    package exp6;

    import java.util.PriorityQueue;
    import java.util.Comparator;

    class HuffmanNode {

    int item;

    char c;

    HuffmanNode left;

    HuffmanNode right;

    // For comparing the nodes

    class ImplementComparator implements Comparator<HuffmanNode> {

    public int compare(HuffmanNode x, HuffmanNode y) {

    return x.item - y.item;

    public class Huffman {

    public static void printCode(HuffmanNode root, String s) {

    if (root.left == null && root.right == null && Character.isLetter(root.c)) {

    System.out.println(root.c + " | " + s);

    return;

    printCode(root.left, s + "0");

    printCode(root.right, s + "1");

    }
    public static void main(String[] args) {

    int n = 4;

    char[] charArray = { 'A', 'B', 'C', 'D' };

    int[] charfreq = { 5, 1, 6, 3 };

    PriorityQueue<HuffmanNode> q = new PriorityQueue<HuffmanNode>(n, new


    ImplementComparator());

    for (int i = 0; i < n; i++) {

    HuffmanNode hn = new HuffmanNode();

    hn.c = charArray[i];

    hn.item = charfreq[i];

    hn.left = null;

    hn.right = null;

    q.add(hn);

    HuffmanNode root = null;

    while (q.size() > 1) {

    HuffmanNode x = q.peek();

    q.poll();
    HuffmanNode y = q.peek();

    q.poll();

    HuffmanNode f = new HuffmanNode();

    f.item = x.item + y.item;

    f.c = '-';

    f.left = x;

    f.right = y;

    root = f;

    q.add(f);

    System.out.println(" Char | Huffman code ");

    System.out.println("--------------------");

    printCode(root, "");

    Output:-

    You might also like