Huffman

shivanisrivarshini asked Jan 7, 2016 • retagged Jun 24, 2022 by makhdoom ghaya

263 views

0 votes

Using Huffman code the number of bits required to have {a,b,c} with frequences 10,10,10 for each letter then the binary codeof bits are ???

Algorithms
huffman-code

+ –

shivanisrivarshini asked Jan 7, 2016 • retagged Jun 24, 2022 by makhdoom ghaya

shivanisrivarshini

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

Its

a-10
b-11
c-0

Rohit Mallik answered Jan 7, 2016

Rohit Mallik

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

915

views

1 answers

1 votes

amrit22 asked Sep 24, 2023

915 views

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

amrit22

amrit22 asked Sep 24, 2023

Algorithms
algorithms
greedy-algorithm
huffman-code

+ –

525

views

1 answers

3 votes

h4kr asked Jan 10, 2023

525 views

Please draw the huffman diagram for the following question

h4kr

h4kr asked Jan 10, 2023

Algorithms
huffman-code
algorithms

+ –

484

views

0 answers

0 votes

BASANT KUMAR asked Dec 2, 2018

484 views

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

BASANT KUMAR asked Dec 2, 2018

Algorithms
huffman-code

+ –

1.3k

views

0 answers

0 votes

Shaik Masthan asked Jul 26, 2018

1,311 views

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

Shaik Masthan asked Jul 26, 2018

Algorithms
greedy-algorithm
huffman-code

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0