Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what is a file a file is a named collection of related information that is recorded on secondary storage a file having either programs or data a file
what is a reference stringan algorithm is evaluated by running it on a exacting string of memory references and computing the number of page faults
what do you mean by best fit best fit allocates the smallest hole that is big enough the whole list has to be searched unless it is sorted by size
what is the basic approach of page replacement if no frame is free is available find one that is not currently being used and free it a frame can
define secondary memorythis memory holds those pages that are not present in main memory the secondary memory is usually a high speed disk it is
define lazy swapper rather than swapping the whole process into main memory a lazy swapper is used a lazy swapper never swaps a page into memory
what is demand pagingvirtual memory is commonly executed by demand paging in demand paging the pager brings only those essential pages into memory
what is virtual memory virtual memory is a technique that permits the execution of processes that may not be completely in memory it is the
what do you mean by first fit first fit allocates the first hole that is big enough searching can either begin at the beginning of the set of holes
define swapping a process needs to be in memory to be implemented 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 linking dynamic linking is same to dynamic loading rather that loading being postponed unless execution time linking is postponed
define dynamic loadingto get better memory-space utilization dynamic loading is used with dynamic loading a routine is not loaded unless it is called
what is the main function of the memory-management unit the runtime mapping from virtual to physical addresses is done by a hardware device known as
what is logical address space and physical address spacethe set of all logical addresses generated by a program is known as a logical address space
what are the methods for handling deadlocks the deadlock problem can be dealt with in one of the three ways a use a protocol to prevent or
what is a resource-allocation graphdeadlocks can be described more precisely in terms of a directed graph known as 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 concurrently in a
what is the sequence in which resources may be utilized under normal mode of operation a process might be utilize a resource in the following
define deadlocka process requests resources if the resources are not available at that time the method enters a wait state waiting processes might
define busy waiting and spinlock when a process is in its critical section any other process that tries to enter its critical section must loop
what is semaphores a semaphore s is a synchronization tool which is an integer value that apart from initialization is accessed only by two
define entry section and exit section the critical section problem is to design a protocol that the processes can use to cooperate every process must
what is critical section problem consider a system having of n processes each process has segment of code known as a critical section in which the
define race condition when several process access and manipulate similar data concurrently then the outcome of the implementation depends on