Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
What is long-term, medium-term, short-term?
In a batch system many processes are submitted than are able to be executed immediately. These processes are reel to a mass storage device, where they are kept back for later execution. The job scheduler or long term scheduler selects processes from this pool and loads them into memory fro execution.
The CPU scheduler or short term scheduler selects from among the processes that are ready to allocates and execute the CPU to one of them. Long term scheduler executes less often whereas short term scheduler executes very frequently. The major idea behind a medium-term scheduler is that sometimes it can be advantageous to remove processes from memory and thus reduce the degree of multiprogramming. Later the process is able to be reintroduced into memory and its execution can be executed can be continued where it left off. Medium -term scheduler swap out and swap in processes.
As we already know, threadsmust ensure consistency; otherwise, race conditions (non-deterministic results) might happen. Now consider the "too much milk problem": two people share
about error detection in operating system and how does it take place?
Characteristics of suspend process Suspended process isn't immediately available for execution. The process may or may not be waiting on an event. For preventing t
Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.
In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a
What is paging? Name the different paging techniques. Paging is a memory management method that permits the physical-address space of a process to be noncontiguous. Paging evad
Define what an assembler is An assembler is machine dependant.
what is the use of valid invalid bits in paging
What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling
Q. The wait() statement in every Java program examples was part of a while loop. Describe why you would always need to use a while statement when using wait() and why you would ne
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd