Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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
memory management using bit maps in this memory is separated into different allocation units each of some particular sizea few bitesconsider every
variable partitioningwe can differ the partitions and change the location according to the size of the
fixed partitioning using fixed partitioning we are able to allocate the memory here we are dividing the memory into a few fixed partitionsevery
write a short note on memory managementmemory management includes reallocating and allocating the memory space the kinds of allocation of memoryfixed
write a short note about context switchswitching the cpu to another process needs saving the state of the old process and loading the saved state for
write a short note about schedulersprocesses migrate between the various scheduling queues throughout its life time the operating system should
write a short note about processunceremoniously a process is a program in implementation a process is too much than the program code which is
how does a program execution take place in multiprogramming while the processor is dealing with a number of programs the sequence with which programs
what is the use of multiprogramming on individual processorsin the usual multiprocessor which is dealing with independent or coarse-grained
what is degree of multiprogrammingdegree of multiprogramming signifies the number of processes in memory if the degree of multiprogramming is steady
effects of multiprogramming on resource utilization with the utilize of multiprogramming batch processing is able to be quite efficient just as
write a note on semaphoresa semaphore is a tool meant for synchronizing multiple processes trying to access a shared variable that is a semaphore is
what is multiprogrammingmultiprogramming the management of many processes within a single processor system operating systems such like unix provide
safety algorithm this is to make sure if the system is in safe state or not it may need an order of m x n2 operation to determine if the state of the
how can the deadlock be preventedbankers algorithm the resource allocation graph algorithm isnt applicable to a resource allocation system with
explain deadlock prevention-resource allocation graph allocationresource allocation graph algorithm using this algorithm we are able to actually
how can the deadlock be prevented-safe state safe state a state is safe if the system is able to allocate resources to each process in some order and