16:04 I do not get why these calculations are made.... If there is a fixed size for each of these partitions, we need only have an array of partition sizes, order the pointers to those partitions according to their sizes and compare the process size until we find the first one that's equal in size or larger than the process. If it's occupied, go on to the next one. Why waste computing cycles checking for every single partition?
Wow, very easy to follow your video and the contiguous memory allocation is crystal clear to me now. I really appreciate it.
Thank you so much.
You really helped me understand it before my exam tomorrow morning.
Your videos are Gems !
Your videos are really useful, greetings from lebanon
Спасибо! Хорошо что есть Русский перевод
wonderful video!
Thank you for this video ❤
Thanks to COVID I get a chance to learn from u.
This is teaching for real
16:04 I do not get why these calculations are made.... If there is a fixed size for each of these partitions, we need only have an array of partition sizes, order the pointers to those partitions according to their sizes and compare the process size until we find the first one that's equal in size or larger than the process. If it's occupied, go on to the next one. Why waste computing cycles checking for every single partition?
Thanks a lot ❤
❤
Innovative.
Thank you, that was very helpful!
Thank you for such an easily understandable video. I find the Dinosaur book tough to understand for some concepts
where can i find more tutorials from u
quite