L-4.4: Huffman Coding Question in Greedy Technique | Imp Question for all competitive exams

preview_player
Показать описание

👉Links for DAA Notes:

🧑‍🎓Contributed by: Junaid Gazi

🧑‍🎓Contributed by: Mannu Garg

The idea of providing these questions is to evaluate GATE aspirants randomly from any topic of full Syllabus. Our aim is to give the you quality questions from full syllabus. Its just for your Practicing.
Huffman Coding is a technique of compressing data to reduce its size without losing any of the details. It was first developed by David Huffman.
Huffman Coding is generally useful to compress the data in which there are frequently occurring characters.

#huffmancodingQuestion#greedyTechn

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

waah pura concept hi change kr diya, first video m to bs ek minimum element pick krna tha or sum k saath compare krna tha, ab 2 min element pick krne h or alag se node bhi bn rhe h nice one
pure notes ki esi ki tesi ho gyi

baby_python
Автор

i think stain lee was working on you to launch in his new movie because you are the real super hero

arpangupta
Автор

after watch this lecture, am little bit confuse which one approach is correct or not . in previous video u have studied with another method and now it's new method.
let me know anyone if know.

prmaddy
Автор

Guys!! this is the correct procedure to draw Huffman Tree(rather than the previous video).

Another simple approach. Write the frequency in ascending order (with respective Characters)
Select the min 2. add it. compare the next 2 min with the remaining freq. along with the added one.

pablu_
Автор

in the last video you did something else now u r doing this method in this problem. Which one is correct. Because from the last approach we get different answers.

mrmrkumargaurav
Автор

Sir ...but approach in last Huffman video was different....when to make separate tree ?

garimagahlawat
Автор

But maine aapse pehle solve karna ka socha aur mera required bit aya 73 bits and avg bits aya 2.43 bit aya, is it also correct?

Hemlata-fhvb
Автор

Sir, how do we decide when to create a separate graph (b and c)?
In your huffman coding video, you used minimum number to extend the tree.
But, here you created a separate branch of b and c.
Thanks for the videos!

VantasticMusic
Автор

Sir but in previous video u made tree in different way please sir reply I am confused

cartoon_dekho
Автор

2:28 Sir, I think it is max heap because root is always greater than its child

kmishy
Автор

Sir in previous video you taught that we have to simply make a Huffman tree by putting the frequency on left or right side but here you introduce a new method
Which one should we follow?

ritikshrivastava
Автор

After add you should sort that numbers, like heapify method so for every 2 small elements you have to create a graph like that and sort it with that message frequency.
Previous video sir missed that.

TECHNIZATION
Автор

Just pulled off a whole day by watching your videos and going to give my mid semesters examination tomorrow. Thank you, extremely grateful <3

dibakarupadhyay
Автор

Please answer, can i solve this question with previous video huffman tree concept

aryantiwari
Автор

Sir this is different from what we had learnt in the last video.

mehtabahmed
Автор

Watching 30 minutes before exam 😅😅😂
Thanku sir for amazing explanation ❤❤

rahultechtube
Автор

why u created a separate graph pls tell
in prev. video you didnt do that

gameplayy
Автор

confused..prev video's method was different..which one to follow?

snobershahzadi
Автор

I have a doubt
Why 9 comes right of 8 why not left of 13 ??

ashutoshkumaranshu
Автор

yaar apna 4:56 is time pe confusee kar dia and ap convey bhi nahi kar rahe its different from which you explained in previous video 😢.

my question is why 9 is compared with 8 it is greater than 13 as well ?

please answer 4:56

mukulkumarsah