After making video, take all pages which you use in video, scan by CamScanner, make PDF, and provide link in description. It's will be very helpful to revise whole topic for students.
Great explanation mam but I just want to ask a question what are the node numbers after shuffling you haven't discussed in both the videos i.e. in tree updation as well as in encoding??
Hi mam, i wanna ask u a question. How to encoding other characters that out of alphabet? I mean for ex. I want to encoding "kamu siapa?". The characters contain "?" and " " character. So, how to encoding these characters that contain "?" and " " (space). In this video, u just give us some characters that not contains other characters. So, can u tell me how to fix it?
what if the weight of an external node above is less than the weight of an external node below it? should we shuffle that too? or only when weight of left child is more than right child?
mam jab apne tree update kiya tha to tab apne symbol k liye different tree tha .But jb encding hua to respective tree preceeding tree kyun h?? like for " aard " why we are considering tree of " aar ".?
Actually m= 2^e + r, where m is no. of English alphabet i.e 26. So we have to find the value of e & r in such a way that it satisfies the equation. Therefore e=4, r= 10.
Shubhi Agarwal Hi! Actually we find the value of k in English alphabet.So the position of r in English alphabet is 18.That's why we take the value of r=18 in video.Thanks
This is easily the best video on Adaptive Huffman.. Thank you ma'am.. Lots of respect..:)
ma'am haha
you are superb , i dont understand how the people dislike your video...whatever god bless you keep doing like this...
After making video, take all pages which you use in video, scan by CamScanner, make PDF, and provide link in description.
It's will be very helpful to revise whole topic for students.
Great explanation mam but I just want to ask a question what are the node numbers after shuffling you haven't discussed in both the videos i.e. in tree updation as well as in encoding??
Its amazing Ma'am..
You explained in very simple way..
Thank you so much ma'am..
Thanks 4 appreciation...
itechnica your welcome
i was attending your tutorial given in english language mainly in compailer design course but now am getting cofused with your language
thank you sis
Very nice explanation 🎉🎉
your all video are very understanding nd easy thank uh so much for help 👌🙏🏻
Best video on data compression.
great. you explained very nicely.
best explanantion about adaptive huffman
Mam aap achha teach karti hain , sach bolu to aapke aawaz me dam hai, I am fan of your voice
Thanks for save my 14 marks
Wow mam, thank you so much, nice explanation. Once again thank you mam.
shuffling ke baad node no. update nahi kiya plzz tell what changes will be made in node no.
Superb video thank you so much
nice microphone. so clear
Don't we need to swap at the last .. as we insert k . The parent node to v becomes 2 and d is 1 ? So shouldn't we swap the node d with that ???
If u want to encode further more symbols then u can swap , but if u have this input,you may or may not swap.
17 as 5 bit me kasey convert kiya apne mam : mam plz help krdo lockdown me
Represent 17 as 5 bit in terms of 16 8 4 2 1. So it will be represent as 10001.
@@itechnica ye to ek tarha se yaad karne vala process hoga 10001 nikal te kisey hai mam ek small se videos bana do mam plz
Hi mam, i wanna ask u a question. How to encoding other characters that out of alphabet? I mean for ex. I want to encoding "kamu siapa?". The characters contain "?" and " " character. So, how to encoding these characters that contain "?" and " " (space). In this video, u just give us some characters that not contains other characters. So, can u tell me how to fix it?
Oh, okay. m will become 28, e=4, and r=12. Thanks.
Awesome video very important topic nice teaching
for r, k ki value 18 kaise ho gayin? please tell me
In alphabet sequence a=1,b=2......
Similarly R=18
While shuffling y the weight of r changed to 0. Before shuffling it was 1. Incase of d it remains same even after shuffling. I dont get it.
Hello Dear,
The weight of r does not changed after shuffling.(23:11)
My question was why r position changed to left side of root while the d remained on right side after shuffling?
Because the wt of R is less than to its left child.
when the wt of left child is more than right child then we have to shuffle it.
what if the weight of an external node above is less than the weight of an external node below it? should we shuffle that too? or only when weight of left child is more than right child?
Hi! We swap the nodes, only when weight of left child is more than right child.Thanks
mam jab apne tree update kiya tha to tab apne symbol k liye different tree tha .But jb encding hua to respective tree preceeding tree kyun h?? like for " aard " why we are considering tree of " aar ".?
For encoding we are considering previous tree and then we update the tree for that symbol.
Your teaching skill is awesome ma'am.....
But you need to improve the quality of video for better experience
very good explanation
how you calculate 5 as 10 bits, 3 as 5 bits etc?
thank you ma'am. it really helped alot.
good... I understand everything
Sarcasm?
When we shuffle then the positions of d and v are not changed
Thanks for making dc video
is 15 will remain same for all cases ? tell me ?
What 15 u r asking? Explain in detail.
Shuffling k vaad node no Kia hoge mam
what to do when special character comes during encoding
What if e=8
Than 2^8=256 which is bigger than 26
Actually m= 2^e + r, where m is no. of English alphabet i.e 26. So we have to find the value of e & r in such a way that it satisfies the equation.
Therefore e=4, r= 10.
How is the value for k=18 im case of r?position of r is 3 so k should be 3
Shubhi Agarwal Hi! Actually we find the value of k in English alphabet.So the position of r in English alphabet is 18.That's why we take the value of r=18 in video.Thanks
could you tell me the last tree which is updated, which you skipped in the video
nehal kadaganchi Hi! For last updated tree pls watch my video no.14( Adaptive Huffman Tree updation) in which I have create all tree.Thanks
for d 00+00011 you wrote code 0000011 ? how
I already discussed in my video that how we calculate the code for d? Just go through it...
awesome! really helped a lot!!
Lakshya Chawla Thank u 4 appreciation
have any video about static encoding in your channel???
Riazul Robi Hi! Watch video no 1 in Data compression list for static encoding
Thank you so much
Mam please provide the notes for all videos
Thanks
Mam ye k ke value kha se aa rhi hai ye samaj ni aa rha
K is the position of alphabet , i.e a=1 and so on.
ok
code ?
d at 4 must be having e+1 bits
Sachit Pahwa Hi! Ya u r right ,it is (e+1) bit as 3 is represented in 5 bit. I also doing the same thing. Just write e in place of e+1.
k ki value kaise nikalni h pllz batayein
Thank you😁
Plz provided notes
K ki value har Alphabet ke liye alag hae ? Kse? Mile ga ?
K is the position of alphabet i.e a=1, b=2 and so on
Thank You :-))
0(51) kasa aya ya mam
Kindly watch video no 14.
Total no of nodes=(2m-1) where m=26 alphabet.
So Max no of nodes=51
k ki value kaise nikalna hai plllzz mujhe batayein
The value of k depend upon the position of alphabet which is to be encoded.For eg: a=1,b=2....
Tysm
please mam upload video on Boolean retrieval
shah siddhi Hi! We have already uploaded. Kindly check the playlist of information retrieval.
Thanks
Thank you
Thanks a lot ❤
When D counterd k for d in 4 while condition is wrong take you
Good
Please try to explain in English thank you
We will surely try to do that from our upcoming lectures. Thanks for your support and feedback.
Title in english but content isn't? Dislike, sorry.