6 votes 6 votes Which of the following is/are TRUE about Huffman Coding? (Mark all the appropriate choices) Huffman coding may become lossy in some cases Huffman Coding does not always have an exact solution In Huffman coding, no code is prefix of any other code There exists a greedy algorithm to do Huffman coding Algorithms go2025-algorithms-1 huffman-coding multiple-selects + – gatecse asked Aug 18, 2020 • edited Aug 19, 2020 by soujanyareddy13 gatecse 348 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Huffman coding is a lossless coding and has an exact greedy algorithm. In this coding, the codes are represented by the binary paths from root to leaf and thus no code can be a prefix of another. gatecse answered Aug 18, 2020 • selected Aug 14, 2021 by Arjun gatecse comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Harshit Dubey commented Aug 3, 2023 reply Follow Share @Sachin Mittal 1 sir what do we mean by “ no code can be a prefix of another.” in this question ? 0 votes 0 votes krishnajsw commented Dec 20, 2023 reply Follow Share @gatecse what does lossy mean here ? 0 votes 0 votes DEBANJAN DAS2k commented Jan 22 reply Follow Share @krishnajsw it should mean lossless compression ie huffman codes should uniquely generate each character, no ambuguity should be there(here is where prefix free codes come into pic ) 0 votes 0 votes Please log in or register to add a comment.
