Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
explain about paginganswer paging is a memory-management scheme that permits the physical-address space of process to be noncontiguous paging avoids
explain about deadlock detectionin deadlock situation the system must provide an algorithm that verifies the state of the system to verify whether a
briefly discuss on bankers algorithmthe resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple
explain about deadlock preventionin order for the occurrence of deadlock the four conditions like mutual exclusion hold and wait no pre-emption
why are segmentation and paging sometimes combined into one schemesegmentation and paging are often combined in order to improve upon each other
describe the following allocation algorithms a first fit b best fit c worst fit a first-fit search the list of available memory and allocate the
explain the difference between internal and external fragmentationinternal fragmentation is the area in a region or a page that is not used by the
what do you mean by first fitfirst fit allocates the first hole that is big sufficient searching can either start at the starting of the set of holes
what do you mean by best fitbest fit allocates the smallest hole that is big sufficient the entire list has to be searched until it is sorted by size
what are the common strategies to select a free hole from a set of available holes the most common methods area first fitb best fitc worst
define swappinga process requires being in memory to be executed though a process can be swapped temporarily out of memory to a backing store and
what are overlaysto enable a process to be larger than the amount of memory allocated to it overlays are used the idea of overlays is to keep in
define dynamic linkingdynamic linking is same to dynamic loading rather that loading being postponed unless execution time linking is postponed this
define dynamic loadingto obtain better memory-space utilization dynamic loading is used with dynamic loading a routine is not loaded until it is
what is the main function of the memory-management unitthe runtime mapping from virtual to physical addresses is done by a hardware device known as a
what is logical address space and physical address spacethe set of all logical addresses formed by a program is known as a logical address space the
define logical address and physical addressan address formed by the cpu is referred as logical address an address seen by the memory unit that is the
what is bankers algorithmbankers algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple
what are a safe state and an unsafe stateanswer a state is safe if the system can allocate resources to every process in some order and still
define deadlock avoidancean alternative method for avoiding deadlocks is to need additional information about how resources are to be requested every
define deadlock prevention deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual
what are the methods for handling deadlocksthe deadlock problem can be dealt with in one of the three waysa use a protocol to prevent or avoid
define request edge and assignment edgeanswer a directed edge from process pi to resource type rj is denoted by pi-gtj it signifies that process
what is a resource-allocation graphdeadlocks can be explained more precisely in terms of a directed graph called a system resource allocation graph
what are conditions under which a deadlock situation may arisea deadlock situation can arise if the following four conditions hold simultaneously in