Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
define secondary memorythis memory holds those pages that are not there in main memory the secondary memory is usually a high speed disk it is called
what is a pure demand pagingwhen starting implementation of a process with no pages in memory the operating system sets the instruction pointer to
define lazy swapperrather than swapping the entire 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 memoryvirtual memory is a method that allows the execution of processes that might not be completely in memory it is the separation
explain the basic concepts of segmentation segmentation definitionuser view of programhardware used with diagram-segment table base limit amp
inverted page tablein page table the page table has one entry for every page that the process is using the operating system must translate this
hashed page tablesa common approach for handling address spaces larger than 32 bits is to use a hashed page table every entry in the hash table
hierarchical pagingsingle way is to use a two-level paging algorithm in which the page table itself is also paged a logical address is separated into
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