Recent questions tagged huffman-code / GATE Overflow for GATE CSE

4 votes

1 answer

1

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 19
Which of the following frequencies for A,B,C and D can generate the following Huffman tree? (Select all that apply.) $p_A=0.4, p_B=0.3, p_C=0.2, p_D=0.1$ $p_A=0.35, p_B=0.25, p_C=0.2, p_D=0.2$ $p_A=0.25, p_B=0.25, p_C=0.25, p_D=0.25$ $p_A=0.2, p_B=0.35, p_C=0.2, p_D=0.25$

Which of the following frequencies for A,B,C and D can generate the following Huffman tree? (Select all that apply.)$p_A=0.4, p_B=0.3, p_C=0.2, p_D=0.1$$p_A=0.35, p_B=0.2...

GO Classes

467 views

GO Classes asked Feb 5

11 votes

1 answer

2

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 42
Consider the following statements related to Huffman's algorithm: $\text{S1:}$ If there is exactly one symbol with a frequency of $1 / 3$, and all other symbols have frequencies strictly less than $1 / 3$, then Huffman's algorithm may ... $\mathrm{S} 1$ is false, but $\mathrm{S} 2$ is true. S1 is false, and S2 is false.

Consider the following statements related to Huffman's algorithm:$\text{S1:}$ If there is exactly one symbol with a frequency of $1 / 3$, and all other symbols have frequ...

GO Classes

671 views

GO Classes asked Jan 28

11 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 1
Consider the two statements regarding the Huffman's algorithm - $\text{S1:}$ The character with the highest probability (all probabilities are unique) is guaranteed to be one of the leaves that is closest to the root (i.e it ... $\mathrm{S} 2$ is correct Both are correct statements Both are incorrect statements

Consider the two statements regarding the Huffman's algorithm -$\text{S1:}$ The character with the highest probability (all probabilities are unique) is guaranteed to be ...

GO Classes

902 views

GO Classes asked Jan 21

1 votes

1 answer

4

consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message

amrit22

679 views

amrit22 asked Sep 24, 2023

3 votes

1 answer

5

Please draw the huffman diagram for the following question

h4kr

497 views

h4kr asked Jan 10, 2023

0 votes

1 answer

6

Which one is right ? what will be the right answer assigning 0 to the left edges or right?

Nisha Bharti

582 views

Nisha Bharti asked Nov 26, 2022

0 votes

1 answer

7

#made easy workbook questions
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heap b. Binary max heap c. AVL tree (height balanced bst)

Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...

Shraddha dwevedi

339 views

Shraddha dwevedi asked Nov 24, 2021

13 votes

2 answers

8

GATE CSE 2021 Set 2 | Question: 26
Consider the string $\textrm{abbccddeee}$. Each letter in the string must be assigned a binary code satisfying the following properties: For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter. ... which satisfy the above two properties, what is the minimum length of the encoded string? $21$ $23$ $25$ $30$

Consider the string $\textrm{abbccddeee}$. Each letter in the string must be assigned a binary code satisfying the following properties:For any two letters, the code assi...

Arjun

9.5k views

Arjun asked Feb 18, 2021

5 votes

2 answers

9

ISRO2020-34
Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded as $BACE$ $CADE$ $BAD$ $CADD$

Huffman tree is constructed for the following data :$\{A,B,C,D,E\}$ with frequency $\{0.17,0.11,0.24,0.33\ \text{and} \ 0.15 \}$ respectively. $100\ 00\ 01101$ is decoded...

Satbir

4.6k views

Satbir asked Jan 13, 2020

0 votes

0 answers

10

virtual gate(huffman coding)
We use Huffman's algorithm to obtain an encoding of alphabet {a, b, c} with frequencies fa, fb, fc. Which of the following codes cannot possibly be obtained (no matter what the frequencies are) Code 1 = {0, 10, 11} Code 2 = {0, 1, 00} Code 3 = {10, 01, ... 2 (B) Only code 2 and code 3 (C) Only code 1 and code 3 (D) None answer given -(B) why code 3 is incorrect??

We use Huffman's algorithm to obtain an encoding of alphabet {a, b, c} with frequencies fa, fb, fc. Which of the following codes cannot possibly be obtained (no matter wh...

BASANT KUMAR

463 views

BASANT KUMAR asked Dec 2, 2018

0 votes

0 answers

11

self doubt on HUFFMAN
in Huffman Code, we get extract the minimum at each time, but my minimum is creating duplicate, then which one i choose? i am getting the same avg.no.of bits for every Huffman tree, but the problem is my tree is changing therefore representing the character also changed, if some one asks ... $\frac{12}{30} $

in Huffman Code, we get extract the minimum at each time, but my minimum is creating duplicate, then which one i choose?i am getting the same avg.no.of bits for every Huf...

Shaik Masthan

1.3k views

Shaik Masthan asked Jul 26, 2018

0 votes

1 answer

12

MadeEasy Test Series: Algorithms - Greedy Algorithm
Consider the following message: The number of bits required for huffman encoding of the above message are __________? My Strategy:- But the answer given is 52bits i used standard Algorithem Made Easy Solution :-

Consider the following message:The number of bits required for huffman encoding of the above message are __________?My Strategy:- But the answer given is 52bits i used st...

Na462

4.4k views

Na462 asked Apr 30, 2018

1 votes

2 answers

13

Space complexity of Huffman coding
what is Space complexity of Huffman coding?

what is Space complexity of Huffman coding?

Akash Kumar Roy

4.0k views

Akash Kumar Roy asked Apr 26, 2018

1 votes

0 answers

14

Huffman Coding
Which of the following statements is/are correct? P:In Huffman Coding, the item with the second lowest probability is always at the leaf that is furthest from the root Q: In Huffman Coding, the item with the highest probability is always at the leaf that is closest to the ... leaf that is the child of the root Edit :Answer is P and Q R is not always true and always word i missed :(

Which of the following statements is/are correct?P:In Huffman Coding, the item with the second lowest probability is always at the leaf that is furthest from the rootQ: I...

sunil sarode

1.6k views

sunil sarode asked Jan 27, 2018

1 votes

0 answers

15

Huffman code solution
RavindraBabu Ravula is trying to send a message to Anand. The following message is: GATE2018GAATTTEEEE22000011188 What is the average length of bits required for encoding each letter using Huffman coding___? given solution : My solution using min heap ? I am also ... ,does we get more than one tree and hence more than one solution? sorry if it is naive and already discussed

RavindraBabu Ravula is trying to send a message to Anand. The following message is: GATE2018GAATTTEEEE22000011188What is the average length of bits required for encoding ...

sunil sarode

1.4k views

sunil sarode asked Dec 28, 2017

0 votes

1 answer

16

huffman code
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1 for right) the minimum no of bits required to represent all the symbols together is?? a)1 b)2 c)3 d)4 which bit this question asking??

question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1...

aaru14

6.4k views

aaru14 asked Dec 2, 2017

1 votes

3 answers

17

Huffman coding
The following message is: GATE2018GAATTTEEEE22000011188 What is the average length of bits required for encoding each letter using Huffman coding___?

The following message is: GATE2018GAATTTEEEE22000011188What is the average length of bits required for encoding each letter using Huffman coding___?

Parshu gate

2.7k views

Parshu gate asked Nov 16, 2017

2 votes

1 answer

18

Huffman coding

atul_21

694 views

atul_21 asked Nov 13, 2017

3 votes

2 answers

19

Optimal merge pattern
Is there any difference in between draw tree for huffman coding and optimal merge pattern if yes please give detailed explanation.

Is there any difference in between draw tree for huffman coding and optimal merge pattern if yes please give detailed explanation.

learner_geek

3.5k views

learner_geek asked Jul 23, 2017

1 votes

2 answers

20

huffman coding
how to find the comparision complexities in huffman coding algorithm?

how to find the comparision complexities in huffman coding algorithm?

akankshadewangan24

1.2k views

akankshadewangan24 asked Jul 2, 2017

1 votes

1 answer

21

What would be Huffman coding for :
What would be huffman coding for following : Character Frequency a 10 l 15 i 12 o 3 u 4 s 13 t 1 Explain this with suitable diagram..

What would be huffman coding for following : CharacterFrequencya10l15i12o3u4s13t1Explain this with suitable diagram..

Anup patel

815 views

Anup patel asked May 21, 2017

0 votes

1 answer

22

Huffman coding question
Question:What is the time complexity of Huffman algorithms when the input is already sorted

Question:What is the time complexity of Huffman algorithms when the input is already sorted

Rackson

710 views

Rackson asked Apr 19, 2017

0 votes

2 answers

23

gready
A file contain charecters a,e,i,o,u,s,t with frequencies 10,15,12,3,4,13,&1 respectively , if we use huffman codeing for data compression then avg code length will be .

A file contain charecters a,e,i,o,u,s,t with frequencies 10,15,12,3,4,13,&1 respectively , if we use huffman codeing for data compression then avg code length will be .

air1ankit

429 views

air1ankit asked Mar 22, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true