First fit, Best fit, Worst fit dynamic memory allocation algorithm
Вставка
- Опубліковано 25 гру 2018
- In first fit we allocate first free partition that can accomodate the process
In Best fit we can allocate the smallest free partition so that the left memory after allocating is smallest
in worst fit we allocate the largest partition so that the left memory after allocating is largest
sir Ap ki 6 min video sy mere 4 marks a gay thanks
Thanks
Please like share and subscribe
Aur mere 2 marks aagye 🥲
Some mistakes. You never calculate the remaining partition spaces. There are memory blocks where two processes can be placed acc. to the algos.
How we can find it?
yes in dynamic memory allocation
Worst fit would be good if processes could be allocated only as each other's children. If you'd run out of room you'll have to have separate memory to refactor though.
Thanks for the info, I don't think we speak the same language but you've got the neatest handwriting I've seen in a maths/physics/computing video lol
THE best explenation I've ever seen for these problems
great work !
♥♥
Thanks 🙏
Please like share and subscribe
amazing outstanding and helpfull video sir
bahut accha lga
Thanx a lot Shariq
please also share it with ur friends
Thankyou sir. You are the best !!!
Thanks a lot
Please like share and subscribe
Very nice explanation
Thanx a lot
Please subscribe and share
this is fixed partition not dynamic!
Thank You😊
Welcome
Thanks sir .. aapne mere 13 number save kr liya ❤
Welcome bhai
Like share and subscribe kr dena please
Dynamic memory allocation means allocate in runtime...which will not create memory wastage
So it may be static??
Thanks. 🙏👍
Welcome
Please like share and subscribe
thank you so much!!
Welcome
THANK YOU 🙏
Please Like share and subscribe
Is there a case possible in which best fit and worst fit can allocate the jobs in same order
Probably when all memory blocks are of the same size and our data can fit into the given block size?
Ty
Please like, share and subscribe
So much helpful in exam preparation.
Thanx a lot
Really it's good understanding sir aap bohot achha padhate ho aap hamare college me ajao padhane ke liye 🥰
Sure bhai bohot jaldi😊
Please like share and subscribe
thanks!
Welcome
Please like share and subscribe
❤
Thanku for help
Thanx Tamanna please subscribe channel and share the video with ur friends
Thankyou
Please like share and subscribe
Thanku sir.
Welcome
Please like share and subscribe
Thnx brother ☺️☺️
Welcome brother
Please like subscribe and share
Thanks a lot sir
Welcome
Please like share and subscribe
Best bataya aapne ❤❤
Thanx a lot
Please Like Share and Subscribe
Very good explanation❤
Thanks brothers
Please like share and subscribe
Thanks
Please like share and subscribe
@@universitysolutions3798 Done
Thanx brother
thANK UUUUUU🤩
Welcome
Please like share and subscribe
big fan sir 😍
Thanks
Thanks sir
Welcome.
Please like share and subscribe
Thankyouyyyyy so muchhhhhh
Welcome Brother
Please like share and subscribe
thankyou sir
Welcome brother
Please like share and subscribe
Can some memory be placed on hold on best fit
No
Mere exam me same question aaygya
Mje aa gye 😁😁🎊🎊
8 number me
Mca galgotia University
Congrats
Tq sir❤️
Welcome
Please like share and subscribe
#tq sir 🤗
Thanx
Please like share and subscribe
Araa sir please Mt boliya hm like share and subscribe kr Diya hai or friends log ko bhi bol diya hai 🤗🥰 okay
Thanx bhai
I got it without needing to understand Indian language
You missed the next-fit memory allocation...
It's a static allocation algorithm not a dynamic
Why you are starting allocation from bottom? I see other videos they filled from top
Exactly which one is right approach?
3:07
please solve my problem if partition is not given then what to do?
Please elaborate your doubt
@@universitysolutions3798 Question is
Consider a swapping system in which memory of following hole size in memory order:-10k,4k,20k,18k,7k,9k,12k and 15k.which hole is taken for successive request of :
i) 12k
ii)10k
iii)9k for first fit,best fit,worst fit and next fit.
Please solve this question 🙏🏻🙏🏻
here the partition is given as 10k,4k,20k,18k,7k,9k,12k, and 15k@@web_with_gautam94
you never calculated remaining partition space
First fit is wrongly solved !!! Kindly update it.
bro get a light i can barely see anythng!!
It's Wrong you have not considered remaining values
This is wrong! This is not for dynamic memory allocation!
This is correct
Example taken from book
@@universitysolutions3798 this is not an example of dynamic allocation.
Can you explain in English
😅q
Are bhai aapne Next Fit toh bataya hi nahi
Next fit topic me nhi tha
@@universitysolutions3798 actually mere teacher ne kaha padhne ka but ultimately it was not in exam.
@@universitysolutions3798 keo ni ata 1st fit kae bad next fit ata hae
@@universitysolutions3798 jab 1st fit mae jab memory allocate ho jae jo space rah jae or dosre memory ko 1st fit sae jo bacha ho os mae dal dae ose next fit kahte hae
Yeh astrotalk ad ko band kro yaar
Not in my hand. Sorry
Chup chup kiyo kar rha ha irritate ho rha ha bhai
why tf would you put the title in english then start speaking an indian language
Video in Hindi but title in English 👎
पहला फिट, सबसे अच्छा फिट, सबसे खराब फिट डायनेमिक मेमोरी एलोकेशन एल्गोरिदम
Should he put this in his title now?
@@premium_editsvhi na
@@vegeta-77 enko hindi ati hai fir bhi natak karte hai 🤦🏻♂️ The person in the video didn't speak English because the Indian accent is difficult for everyone to understand, so he simply dictated in Hindi.
Yes, and?
@@arshitachaudhary359 And, your video title is misleading for the viewer. You made your video clickbait, which is morally a very shitty thing to do.
❤️
Please like share and subscribe