In this video, we will discuss about Huffman Coding also known as Huffman Encoding which is a greedy Algorithm for lossless data compression.
Topics covered in the video-
1) Introduction to Huffman Coding and its concepts
2) Major steps in Huffman Coding
3) Steps to construct Huffman tree
4) Important formulas for problem solving
5) Problems based on Huffman Coding
6) Time Complexity Analysis of Huffman Coding
For details, please watch the video.
Get these handwritten notes from website here-
https://www.gatevidyalay.com/huffman-coding-huffman-encoding/
Huffman Encoding is an important topic for semester examination as well as competitive examinations like GATE, NET etc.
Watch the complete Algorithms Tutorials here-
https://www.youtube.com/watch?v=H4Ifnffy3Ts&list=PLwmA1T37CsHpuqdquKCmAJeScAhOCStLI
Follow us on-
LearnVidFun Facebook : https://www.facebook.com/learnvidfun
Gate Vidyalay Facebook : https://www.facebook.com/GateVidyalay
Gate Vidyalay Website : https://www.gatevidyalay.com
For any doubts/ queries, please comment below...
Please...Like, share and comment if you really gained something from this video and don't forget to subscribe yourself for getting the latest updates!
Your support really encourages us to do better....Thank you!! :)
All the best...Keep learning :)
