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 are scheduling queues?
Since the processes enter the system they are put into job queue. This queue contains all processes in the system. The processes that are exist in main memory and are ready and waiting to execute are kept on a list called as the ready queue. The queue is in general stored in as a linked list. A ready queue header consist pointer to the first and final PCBs in the list. We extend every PCB to include a pointer that points to the next PCB in the ready queue.
When the process is assigned the CPU, it implements for a while and executes for a while and eventually quits is interrupted or waits for the occurrence of a particular event such as the completion of a request for example the completion of an I/O request. In the case of an I/O request such a request perhaps dedicated tape drive and so on. since the system has several processes, the disk perhaps busy with the I/O request of some other processes. The process afterward has to wait for the disk. The listing of processes waiting for a particular I/O device queue is called as a device queue.
A new process is originally put in the ready queue. It waits in the ready in anticipation of it is selected fro execution. Formerly the process is assigned to the CPU and is executing one of several events could take place:
In the first two cases the process finally switches from the waiting state to the ready state and is then put back in the ready queue. A process keep going this cycle until it terminates this cycle until it terminates at which time is removed from all queues and has its PCB and resources deallocated.
swapping technique
Q. List three instances of deadlocks that aren't related to a computer system environment. Answer: Two cars passage a single-lane bridge from opposite directions.
Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre
Compare contiguous-memory allocation with pure paging in the following aspects: 1. In support of dynamic memory allocation: most systems allow programs to allocate more memory t
Problem: a) The CPU can access 2 storage devices directly. What are these 2 storage devices? b) Define 2 key issues involved in memory management. c) How do processes sha
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 avoid deadlocks, ensuring that
Question : The file system is the most visible aspect of an operating system. It provides the mechanism for on-line storage and access to both data and programs of the operatin
Paging full question
Determine a parser which is a variant of top-down parsing without backtracking Recursive Descend parser is a variant of top-down parsing without backtracking.
VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process. Here if a 10k process enters we are able to make a space of
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