3.4 Huffman Coding - Greedy Method

[@michaelbonnet590]

Singh's Law: whatever you are trying to learn, a South Asian man somewhere on the internet explains it perfectly.

[@snehashishsrivastava9018]

Indian the term you are looking for is Indian

[@michaelbonnet590]

@@snehashishsrivastava9018 sometimes they're Bangladeshi or Pakistani or otherwise

[@thiccaxe]

*curry Singh’s law

[@hemantsood9579]

we indians always good with explaining

[@abubakar205]

@@snehashishsrivastava9018 I am Pakistani and agree with this statement

[@carloss.3928]

My professor spent 1 1/2 hr to explain this. This man did it in 17 minutes. Thanks Professor Bari!

[@giannisbraounis5861]

Mine spent 2 hr ....

[@not_intrested]

Same

[@Abhinav-eu5le]

time compression technique

[@TashingaPemhiwa]

...and I learnt it in 12, thanks to KZbin 1.5X :D

[@mathematics6199]

did your professor prove why this is better? if yes, then spending 1.5 hours is worthful,

[@sakshisrivastava7033]

If teaching is a work of art, then you are a master piece sir. Huge respect!!

[@user-yv8ko3wy6t]

Sir, please teach my professors how to teach.

[@smarteducation47]

🤣🤣🤣

[@jagathyagar2794]

Lol

[@nishant_j]

exactly bro

[@AnshuKumar-zn1qb]

Very true

[@codebits2120]

🤣🤣😂

[@aliz5972]

I'm proud to say that i'm his regular student not only on KZbin, on Udemy as well.

[@rahularya7891]

data structure also available there?

[@aliz5972]

@@rahularya7891 g bhai

[@wotizit]

@@aliz5972 teek

[@anujakulkarni8988]

@@aliz5972 How's the data structure course?

[@aliz5972]

@@anujakulkarni8988I can't ask for anything more than that. Content is Complete and precise and the teacher got some skills man. He is genius.

[@PoojaVerma-vz5bn]

He is the best person who explain each nd evry doubt without asking. Thank u sir 😊

[@bhavyapandey]

yes, relatable!!

[@Vikasverma-ns4ob]

That's true

[@crewify5460]

100th like💥

[@nicolausoares5447]

I'm a Brazilian student of computing systems and I learn a lot more with you than with any other teatcher in here

[@hollyj8650]

After I watched this, I did my discussion on my class related to this topic, many classmates thanked me for a clear explanation. Thank you sir. You helped me and classmates too.

[@poojabennabhaktula4883]

Teaching is an art and you are the master of it🙏 thankyou sir you made my DAA concepts clear.

[@steveo5946]

My plans for studying for my Algorithm Analysis class from now on... Step 1 - Read the syllabus to find the topics my professor will talk about in the upcoming lecture. Step 2 - Watch Mr. Bari's videos on topics from step 1. Step 3 - Read book for some more info on topics from step 1. Step 4 - Attend my lecture, and desperately try to stay conscious. Thanks for another great video. +1 cookie for you!

[@purplegalaxy5265]

I passed my DAA thanks to you Sir! Allaah azza wa jal aapko khoob kamyabi ata farmaye! Ameen!

[@manojvarmagottumukkala701]

Never thought learning algorithms would be fun .Thanks ,sir for demystifying algorithms

[@tppt3987]

Huffman Coding starts @ 8:46 .

[@amreys]

Bless you

[@Q8Duelist]

thx!!

[@masterpotato5167]

Thanks

[@kmanikandan1346]

Tq

[@seanwijaya2404]

The way you explain huffman coding makes it very easy to learn and understand. With the help of the simple examples and exercise it also helps me understand the concept better. After watching this video, I instantly understand about huffman coding and how to decode and compress a message.

[@bunwat223]

I'm a self-taught programmer , your videos help me alot . Thank you Sir 😊😊😊

[@logicboard7746]

I can’t believe you are such a good teacher, Sir. You remind me of my digital electronics teacher in my undergrad school

[@yagzyalcntas553]

i took multimedia class and learned this from your video 1 day before exam got 85 then i didnt study for final and didnt do project and got D, then i took the course again and relearned this from your video got B from course. now i am preparing for master degree interview and reviewing again from same video of yours :D thanks for helping me out all these years :)

[@o8let506]

Abdul, please keep doing what you are doing! You are a great teacher and a huge help to confused students. We all appreciate your teaching style very much. Well done!

[@badarikrishna3169]

I've been binge watching his videos, it's so addictive 😂 I keep on reminding myself about the stature he carries, the command he brings, that professor element is something special which will keep you attentive..!! 🙌

[@paragggoyal1552]

dude! same. It's like watching a movie.

[@shrayasichakraborty2375]

I never fast forward your videos,everything you say Sir,is valuable.

[@matthewg4882]

I love you man, i come from my lecture confused and in 1 video I completely understand everything. You have a gift, thank you for sharing it with the world!

[@jkumwenda]

A friend recommended this channel for algorithms, I have never looked back ever since, your approach makes everything easy to understand. I am studying my MSc in Software Engineering and the knowledge I am gaining from this channel is playing a vital role in my studies, Thank you Abdul Bari.

[@umalijnleonard4794]

sure, he is so good.

[@aakashvishwakarma2243]

Sir me college me ek lecture nhi attend karta hun....teachers ko kudh nhi pata hota....unlog kya pada rahe han.....aap jaise logo ka video dekh dekh ke hi sikh raha hun....sir aap aise hi video banate rahiye

[@blekekok]

Now I understand how Huffman Coding works. Your explanation was very clear and simple, with great examples. Thanks

[@timothyliundi1893]

Wow I have no idea that Huffman coding is actually quite easy. You explained it so well that I've never seen such a great lecture. Now I'm interested to decode a message as well as making a decoder tree/table just for fun and play with. What a lecture and keep up the good work!

[@patrickmathenge7996]

I wish all the teacher are like HIM. He is a very good teacher. He understands what students need. Come to Kenya and mentor all the teachers/professors

[@AryanSharmaA]

00:00 Huffman coding is a compression technique 02:25 Message size can be reduced by using custom codes with fewer bits. 04:34 Encoding messages using 3-bit codes 06:44 Table and chart decoding reduces message size by 35-40% 08:58 Huffman code generates variable size codes for characters based on their frequency. 10:54 Variable size codes can be used for message encoding 13:22 Huffman coding reduces message size 15:33 Huffman coding can be decoded to get the original message in ASCII code.

[@odinson4184]

Great explanation. Other videos try to explain it using a trick, but they clearly don't understand what's going on. This video clearly explains the greedy choice!

[@AnayShrikar]

I am glad to see a video actually dwelling into the concepts used behind any algorithm implementation. It's hard to find such videos on KZbin. Great work Sir :)

[@PetBuddies]

17 minutes worth one full set of question. Thanks a bunch, Sir!!! Really appreciate your effort for making the world a better place for learners like us

[@harryboparai4976]

YOU are really a great teacher! Honestly i miss great Indian teachers like you up here in Canada!

[@michaelpeel3716]

Understandable, succinct , well presented - throw out your text books and listen to this man.

[@harinarayanjha5763]

After watching few videos on Huffman Coding, I can definitely say that this is the BEST video for the topic.... GREAT DEMONSTRATION...!!!!! (y)

[@parthphalke4444]

I couldn't understand this concept that my professor had been teaching for over a week. I understood it thoroughly in 17 minutes. Thank You

[@SaurabhSingh-kz5jv]

I am following your videos since months, they're really classic. Thanks a lot for making such classic videos.

[@vidushitandon6176]

Thank you so much, sir. I have a test on data compression tomorrow and I had no idea about Huffman coding. I don't who else would have given a more succinct explanation and I understand this concept more clearly now. You are literally every computer science student's saviour. Thank you so much. Keep up the amazing work!! 🙏👏

[@nextcardashboard]

Mind blowing style and teaching. So soothing and calming

[@shawnyasha7715]

I really Like how you explain Huffman coding very simply and make it for me really easy to understand in one go without having to repeat the video to understand. my favorite part is when you explain how to determine the bit using a tree, and with that, I immediately understand how to compress a message using Huffman coding and also how to decode the message

[@saadebad4123]

ye to abdul bari hai ye to acha bacha hai .... thanks sir

[@kairatopa9564]

ye school b jata h ye quran b pdhta h

[@prathamyadav3105]

Ye bat bhi manta hai...

[@not_intrested]

Lol 😂

[@sandeshparajuli5346]

Best Lecture On KZbin For Huffman Coding.

[@not_intrested]

What? It was that easy 😶 Our teacher explained it in 2 lectures and I slept through both of them as I was finding it difficult as heck!

[@pritomtanvir]

I know right!!

[@theexplorer9012]

😂🎉

[@rajime1645]

While teaching in class u will sleep due to lazy but if we want to clear in exam or forjob u will learn.

[@pedrojoao5786]

Unbelievable explanation! Sr. deserves to be called a greater Teacher!

[@manirajs4658]

Hello Sir, I'm Maniraj. Your Teaching was Excellent.

[@SatyamKumar-bv4fc]

Sir, aapko meri umar lag jaaye and aap aeise hi aage bhi padhate rahe. You are a gem sir.

[@sumitbangarwa1615]

Thank you Sir, the way you explain is marvelous, i saw so many video's but still my concept was not clear but after watching your video i know better.. thanks a lot.. 🙏🏼

[@katrielwidjaja2839]

I really like the way you explain Huffman coding in the video, the explanation is very simple and easy to understand and the examples you use in the video are really helpful, it helps me understand the topic better. Thank You!

[@gousemohiddinmohhammed354]

sir you are making me lazy by covering whole syllabus in a single day GREAT TEACHING

[@juandelahoz4577]

You explained this so quickly yet I understood better than in my teacher's 2 hour class

[@terryn9450]

Such a good teacher... this guy needs to be hire at a college

[@AmanRaj-bt2kr]

I was watching it everywhere on others channel but not able to understand clearly... But somehow i have got your video and ultimately i can say that my concept has been cleared... Thank u so much !

[@sethhannah7191]

Amazing sir! You've done a spectacular job explaining Huffman to me, I appreciate it!

[@rajathshetty325]

Hello Aseem and Azam!

[@eugeniaancilla351]

Your explanation of Huffman coding really helps me understand the topic better. I really like your approach to explaining the topic, where you used a simple example for the coding and decoding steps. Your explanation makes this complicated topic look so simple, thank you for the clear explanation!

[@matSpiritLife]

who has disliked this video? Please dont give dislikes to the videos of Abdul Sir.

[@datascientist1171]

some assholes bro!

[@rallokkcaz]

Some people (mostly western folk) don't like heavy accents and differences in grammar when trying to learn complex topics. I've come across a lot of nearly unwatchable videos on KZbin before but it's never (well it can be) the accent that makes it bad, it's the horrible, inaudible or distorted audio. This video is recorded well and the audio, although clipping a bit, is still intelligible. No dislike from me.

[@dreamscapeai7]

Free and good content should not be given dislikes, Many assholes will not understand one line and rage dislike the video, really selfish according to me

[@AamirKhan-zy5yt]

these are the fastest brain alive.

[@TheGerakas]

Really stupid people that found these lectures difficult to follow.

[@aubreysitepu5249]

This video about Huffman Coding is very easy to understand! I really like the part when you show that we can also use tree other than table since it's simpler and yet very interesting. Thank you for making this video sir!

[@SarbbottamBandyopadhyay]

If anyone is practicing along, the position of B and A in the optimal merge tree got swapped at 16:10.

[@vivek8438]

Yeah but still it is correct

[@warThongo]

@@vivek8438 No. It is wrong.

[@calvintjoaquinn1924]

Your explanation really made me understand Huffman Code. Thanks for helping me learn this.

[@nishtha27]

Thank you very much sir, ths was the best huffman coding explanation i've ever seen.

[@riyapatel7064]

O my goddd! He makes every problem so easyyyyyyy, you’re so much talented and your teaching technique is just wowww! Mind blown😮

[@maths4every1]

Hi Sir, It was very difficult for me to get to know the difference between the algorithms and it's implementation.. But after listening to your videos, I m master in solving those problems. Really I am grateful to you sir.. Thank you so much for your wonderful teaching.. you teach us the very difficult concepts in a simple way.. Really I am very thankful to you sir.. I am struck up in heaps and heapsort concept. Please make a video on it sir.. I didn't find that part. So asking sir.. If it's already been done, please share the link sir.. Thank you so much sir....

[@maths4every1]

Thank you sir..

[@yagzyalcntas553]

@@abdul_bari have you done the heap video sir?

[@yagzyalcntas553]

@@abdul_bari ok :(

[@niksa28]

@@abdul_bari Beautiful video, sir. Are you familiar with Sloot encoding? He was able to compress a whole HD movie down to 4 kilobytes losslessly. He had a library of 370Mb, about 70Mb for each kind of data, movies, sound... He was obviously comparing data to data in his library, generating keys of minimal size which could regenerate the original on the remote computer from the same library. Only way this can be done even in theory is if he reduced big chunks of numbers to small mathematical expressions. For example number 302875106592253 can be shortened as 13^13. If numbers related to this one appear often, we can define it as letter a and then just express those other numbers as 2a, 3a etc. Multistage compression would allow for such extreme compression ratio. Exactly how he did it is not clear.

[@ypv2408]

@@abdul_bari video on amortized analysis plz

[@gilbertaurelioputra]

I'm so thankful for your simple and clear explanation to Huffman Coding with great examples that helps me to further understand. Thank you!

[@amudaadeolubadmus6282]

The above example can be further reduced into 8.625 bytes(69 bits) from 20 bytes(160 bits) Input: BCCABBDDAECCBBAEDDCC [1.] Total number of ASCII characters = 20 [2.] Each ASCII character take minimum of 8 bits( 8 bits = 1 byte) [3.] Required size = 20 * 8 = 160 bits ~ 20 bytes The compression algorithm, [Step 0] : Use a TreeSet [Step 1] : Create a bit_level, and all possible pattern (assume the level start by 1) when bit_level = 1 It means, the bit can only take two forms( either [1 or 0]) (i.e 2^1) [Step 2] : Check character existence in Step [0], doesn't exist goto Step[3], else goto step[4] [Step 3] : Character doesn't exist, and bit_pattern hasn't been exhausted Key that character( perhaps using a DLL--> DoublyLinkedList) with the unused bit pattern B

[@ujin981]

The codes you propose lack a prefix property because BC will not be distinguishable from A.

[@amudaadeolubadmus6282]

Please recheck properly.

[@ujin981]

@@amudaadeolubadmus6282 Please have a look at what the prefix property actually is. And maybe even thank me.

[@amudaadeolubadmus6282]

@@ujin981 Can I assume this is what you're referring to by Prefix Property? "(computing theory) A coding system that uses (typically variable-length) codes that are distinguished by their "prefix property", which requires that there is no code word in the system that is a prefix (initial segment) of any other code word in the system."

[@ujin981]

@@amudaadeolubadmus6282 Yes. Correct. Now you can comprehend that in your example BC is the prefix of A and therefore the proposed codes are not prefix-free.

[@nonamenosurname6127]

Sir you have proved that all the best teachers are in KZbin now.

[@nomanaslamkhan5000]

Awesome explaination SIR. Really smooth and well explained.

[@jeffrbe]

Very good explanation sir. I just realized in the first few minutes that this is how compressing data works. Really enjoy it.

[@megzz9783]

Best teacher ever, god bless you sir ❤

[@asterynn941]

The explanation on the topic is concise and the way you explain it made it sound simple, thank you

[@benajagilman50]

Best explanation on KZbin. Thx.

[@sadmansami2052]

Sir, My CSE faculty encouraged me to watch your videos. Your videos are helpful for students

[@xhamadeex]

beautiful! Just beautiful! Thank you soooooooooooooooooooooooooo much!

[@Zahurafzal]

Really Really amazing Explanation of the huffman Coding. After hours of pounding over other sites this video made this algoithm extremely clear and easy to understand and implement. Thank you.

[@aligoren]

Thanks a lot. You're really good teacher. I followed your channel.

[@giristher6590]

Thanks for your help

[@giristher6590]

Thanks for your help

[@giristher6590]

Thanks for your help

[@SaiSriVidyaKurivella]

This is the most efficient and easiest explanation I guess. Thank you sir.

[@madsamurai1296]

sir the technique you showed is wrong as in huffman tree the smaller node should be on the left side , here you placed 4 to the right of 5 which changed the code of the element d which is wrong

[@jason-yb9qk]

The way you explain it is very easy to understand. As a computer science student your video help me a lot in understanding lots of difficult topic. Thank you sir keep up the good work!

[@vinu525]

Fantastic explanation! Thank you for sharing sir.

[@devanshtiwari3278]

Thanks a lot sir.. because of you only I feel confident in dsa . No one other then you can teach dsa in such a manner , we are blessed to have you . Thankyou sir!!

[@KnightDark1233]

Thank you very much you are a very good teacher

[@howtomo-cap5427]

You are amazing, I cannot understand how this method works until I saw your video, thank you!

[@xarenwo]

Hi, isn't (5) and 4(D) supposed to be inverted under 9? 5 is bigger than 4(D) but stays on the left. Shouldn't it be 4(D) to the left and 5 to the right of 9 ? 9 / \ D(4) 5 By doing those changes, and after calculating the values using software, i get the following codes d:00 e:010 a:011 b:10 c:11 Thank you

[@matteoturini7145]

Is the same problem I got

[@matteoturini7145]

in 4 anni e l'avrai risorto

[@lohithaadapala6989]

Ahhhh Searching for this since ages! AND HERE IT IS WITH CRYSTAL CLEAR EXPLANATION 🤝

[@lokeshselvam2060]

8.37 huffman code

[@goodgamershow6505]

you saved my time

[@devanlucian1598]

I really appreciate your explanation regarding Huffman coding, especially regarding the coding and decoding. The explnation of the tree was reallyceasy to understand becuase of the great explanations and presentation.

[@ShoaibRajpoot]

16:11 A replace by B ... how? before 16:11 A repeats 3 times and B repeats 5 times...

[@FarbodNajafi]

That's another txt. so numbers should be changed.

[@AamirKhan-zy5yt]

concentration level = 9999 😄😄

[@ShoaibRajpoot]

@@AamirKhan-zy5yt bhai mera ppr tha full tnsn mn prh rha tha is ne or de di

[@quratulain1919]

I always feel like seeing you Sir, that he saved me. LOTS OF *RESPECT*

[@arpansarkar7924]

sir if in the message like "Huffman coding is cool" this has spaces in it. Will the spaces is counted? pls reply sir

[@arpansarkar7924]

@@abdul_bari thanks sir you saved my sem i am also a student of you in udemy

[@QuanNguyen-og6pq]

@@arpansarkar7924 a space is just a character, like any other character

[@alica5796]

Thank you for the clear explanation about Huffman Coding, Mr. Abdul Bari! It was excellent, really helps me to understand the concept better since you made the complex concept of Huffman coding become simpler. My favorite moment from this video is when you use a case to introduce and explain the greedy method in the beginning of the video, as well as when to illustrate the greedy method using the optimal pattern tree graph. This is a must-watch video as a computer science student!

[@rownitakhanam5013]

There is a mistake in last part.The tree is diiferent from the previously drawn tree.

[@arindamghosh636]

can you please elaborate?

[@aatasnim4442]

He is the best person who explain each & every doubt without asking. Thank u so much sir 😊

[@mahmudsajib8648]

Your tree construction is wrong. The left side should be 4 and right side should be 5 while creating node 9.

[@wiernadicarneyprasetyo9391]

A concept very well explained with clear voice. I can understand the scope of the problem in the introduction part. Thank you for the explanation.

[@ravikiran7781]

i have a query. if we use Fixed size codes or Variable sized codes(huffman), the number bits to be sent for each characters are reduced for sure. While sending the table information, you mentioned character(8bits) + its fixed or variable sized codes( lets 2 bits for example). How can we send just 2 bits ?? I think we need to send the frequencies of each character again so that tree is reconstructed at the receiving end. But again if we send frequencies, in case of the huffman example it will be = 45(message) + 40(ascii characters) + 40(frequency count) = 125. The same is the case with Fixed. Can you please clarify on this? if it has to work the way you mentioned, my assumption is that this whole data A(01000010) A's Huffman(001) followed by B, C, D etc and the orignal data. But i believe we need to have some kind of delimiters between each pair( character, huffman code) and the before the original data.

[@RanjeetKumar-bf4xf]

Hey Ravi, Your doubt is very genuine now read it carefully, Let say you want to send a message above illustrated example in encoded form with the same frequency as told by sir, now, two things you must keep in mind 1. The same person writes the encoding and decoding message. 2. Your objective is to read(encode) the message not to count the occurrence of a letter. --Your first doubt- You want to send the frequency of the letters with character+fixed or variable size code. ----------------You are sending the original table with encoded table with encoded message, the message will tell the length.( How go to second doubt). --Your second doubt is you want a delimiter to identify each encoded bits. ---------------See, when you will construct the tree, it will generate the each encoded bits in such a way that "No Huffman code of given character will be prefix of another Huffman code". Using this you will be able to extract each encoded message without any mistake. For illustration---- In the above given problem A- 001 B-10 C-11 D-01 E-000 Here you can not find a single encoded character which is the prefix in any other encoded character. Hope it will help you. Thanks

[@rheinokatili8120]

This was a very clear and concise explanation on Huffman Coding. A definite favorite moment of mine in this video is the optimal pattern tree graph that illustrates the greedy approach. It certainly simplifies the complexity of the subject and assisted me in better understanding it.

[@jenex5608]

BEST CS TEACHER ON KZbin

[@apostolosfilippos]

My book is unclear. My teacher is good but talks a lot. You sir are right to the point. Thanks!

[@surajsahu5821]

Your way of explanation is amazing...You tells everything about the topic which associate with other topics.Your starting is very effective of any topic that makes me your fan..You are an Effective Teacher.I am sharing your video with my friends.

[@vincentl94]

the explanation is amazing and easy to understand, especially on how to determine the code.

[@phantasyyy]

This guy a legend seriously. Thanks for your helpful courses! Keep up the good work Mister!

[@shahdeep8701]

kabhi kabhi lagta he abdul bari hi engineers ka bhagvan he...bohot dua milne vali he sir...

[@stankafan6688]

bestam best teacher in KZbin Abdul Bari Sir....

[@gorazdfilipovski3709]

respect for going through the decoding. I was having a hard time on how could the reciever know that he should take 2 or 3 bits for the letter, but I understood that there is no confusion in that because the tree sorts that problem