วีดีโอ

i like your voice

the best❤

Exam in 2 hours, I'm cooked

you are amazing, thank you

you missed a page fault on the the first 7

These videos have been extremely helpful so just wanted to leave a thanks

I have a few questions: In the real examples at the end, can a computer really have 16 TB of RAM? How do we know that the size of the entries in the page table will be 64 bits? Why do we need to include the offset in the page table? I thought the entries just needed page number and corresponding frame number. Can't you still have internal fragmentation with paging? Like if you can't evenly split a process into a number of frames then you're left with one remainder page that isn't completely full? In other words if (process size % page size) != 0 then you have an incomplete page which would cause internal fragmentation. Consequently, does this mean that you definitely cannot have external fragmentation with paging because processes are divided into fixed size pages? Thanks :)

Still Learning

Thank you so much omg. OS is such an annoying class and it's amazing having clear, simple explanations accessible for free online. Really a game-changer

I believe that Professor Cole has confused "first fit" with "next fit" in this video. In first fit, you starts searching to the list of available hole from the *START* of the memory region in which you are dealing with. In next fit, you start searching the list of available holes starting from where you last successfully made an allocation. So in the case of first fit, the example shown at [13:23] has process 1 fitting into region B, followed by process 2 fitting into that portion of region B not occupied by process 1 because there will still be space available in that region which will be found when the availability list is scanned from the beginning again. The situation described at [13:23] will look the way that Professor Cole describes because after process 1 has been allocated to region B, the request for process 1 will start where the search for process 1 left off which means that the *NEXT* region E will be found next.

Salutations from Argentina. Geat content <3

I love your teaching😊

Thank God this video exists

thank yu

you are the best .... i hope your account keeps growing.

Please upload a video on How to thank you very much😂

she speaks so slow that at 1.5x speed still sound totally normal lol

I have exam time but I can't concentrate i am watching shorts evry time.i try to study.

this is one of the greatest videos that explain Contiguous Memory Allocation & Frafmentation, Thanks

Thanks it really helped

hands down the best explanation of TLB in TH-cam

amazing thank you. you explained things very clearly

Спасибо! Хорошо что есть Русский перевод

Super nerdy and I love it.

27:45 How is 1GB × 512B = 512GB Why is the result unit is GB ?

Brace yourself, cash refund incoming

In question 4 (at 23:48 to be precise), each entry in the page table is going to hold a frame number at max, right? We know that we have 2^{32} frames (done at 17:30) in our system. Now, we have 2^{36} entries in the page table with each entry holding a possible 32 bit value referencing the frame (we don't really need 64 bits for this), giving us the total size of page table as 2^{36} * ( 32 bits), right? You have it as 2^{36} * ( 64 bits). Where am I wrong?

wow thank you!!!

i love you from gilgit baltistan

Thank you for this video. Very well explained.

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?

What’s an Offset , Address , Indexing ??

I think no of bits required for page no is equal to the log of size of page table

For people who may be confused, what she is referring to as 'virtual memory' is actually called logical memory. Virtual memory is a whole different thing

thank you !

This exemple is wrong. In the classic second chance algorithm after inserting new data into a frame the reference bit must be set to 1. When starting at frame 0 after inserting 4 into the frame we have to set the reference bit to 1 in this frame. There is also a pointer showing which frame is the candidate frame (victim frame) to insert data at the next page fault. So a the the beginning all the reference bits a set to 0 and the pointer is set to frame 0. Inserting 4. Setting reference bit to 1. Moving pointer to the next frame (in this case frame 1). When there is no page fault the frame where the value is locate will have it bit set to 1 if not already. The pointer will still be set to the last frame in date.

0:45 so I'm not alone confusing "contiguous" with "continuous" 😊

THANK YOU A LOT. This is the video that finally made me understand the topic

❤

thank you so much, i cannot understand when i study at school but you help me a lót

thank you soo much , im glad that you included all the conditions in one question itself

That was good! Thanks Mam!

crystal clear explanation, thanks

the only video which cleared the concept for me thank you casey

Thank you for such an easily understandable video. I find the Dinosaur book tough to understand for some concepts

Thank you ma'am you have saved me

Thanks for the explanation

Great explanation <3

thank you so much 🙏