Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
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
how can the deadlock be preventedto evade deadlocks first we will have to obtain the information about how resources are to be requested and as well
what are the methods for handling deadlocks the technique for handling the deadlocks are we are able to use protocol to prevent or avoid the deadlock
resource allocation graphwhen a process pi wishes an instance of resource type rj a request edge is inserted in the resource allocation graph when
mention the various features that characteristics the deadlock condition the four circumstances that give rise to deadlock condition are1 mutual
producer-consumer problem using semaphoresthe solution to producer-consumer problem use three semaphores namely- full empty and mutexthe semaphore
explain briefly the working of semaphore with example the ew dijkstra 1965 abstracted the key idea of mutual exclusion in his concepts of
what are the different types of semaphoreprincipally the semaphore is able to be classified into two on the basis of their
mention some attractive properties of semaphore the semaphores arent provided by hardware however