Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
write a brief note on demand paginga demand paging is alike to a paging system with swapping the processes reside on the secondary memory while we
what is the hardware support required to implement pagingeach operating system has its own techniques for storing page tables the majority allocates
the different paging techniques are1 multilevel paging or hierarchical paging method in definite cases the page table may consist up to 1 million
what is paging paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous paging evades the
lru approximation page replacement in this we are able to use the reference bit associated with the page entry to choose a page to be removed the
lru page replacementin slightest recently used page replacement algorithm we will replace that page that hasnt been used for the longest period of
optimal page replacementan optimal page replacement algorithm has the least page fault rate of all algorithms the algorithm states that a replace the
fifo page replacementthis is the easiest page replacement algorithm at this juncture the 1st page entering is the 1st to leave that is the oldest
what are the hardware and software requirements for virtual memorythe hardware required for virtual memory is a secondary memory and page table the
what is page fault and what are the steps taken by the os to remove page faulta page fault is caused while a page that hasnt been brought into memory
what is meant by demand paging explaindemand paging is a technique to implement virtual memory in demand paging simply when a page is required it is
variable partitioningwe can differ the partitions and change the location according to the size of the processhere if a 10k process enters we are
fixed partitioning in a fixed partitioning the operating system inhabiting some fixed portion of main memory is available for use of multiple
what are over laysif a large process enters which is huge than the available memory we are able to use overlays in this we can divide process into
what is external fragmentationas process are removed from and loaded to the memory free memory space is bracken into pieces external fragmentation
what is internal fragmentationconsider holes of 20k assume the process requests 18 bites if we allocate accurately the request block we are left with
quick fit algorithamshere we keep apart lists for holes and processes therefore this reduces the searching time for holeshole list and process list
worst fit algorithmhere we obtain the largest space available for the smallest therefore after that process entered there will be much more space
best fit algorithmhere scanning is for the finest fit one signifies it searches the entire list for the best fit position for the process therefore
next fit algorithmhere scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process
first fit algorithmscanning a list along with if a free hole is available with necessary space for the process to allocate it allocates the process
how is memory management done using bit mapsa bit map is here in this we signify the bit value as 0 or 11-hole0-processin this we are able to
what is a buddy systemwe are dividing the memory as powers of two therefore the division will be 2 4 8 16 32 64 128 256ie in powers of 2 as well as
memory management using buddy sustemhere we are dividing the memory as powers of two as well as we are selecting the space which is smallest but
memory management using link liststhe first one is for showing it is process or hole second is for starting address and third is for length of the