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 a buddy system?
We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecting the space which is smallest but large enough to hold a process. Assume we have 1M memory. If a process 70k enters we are able to choose the 128k which will be the best fit for the process. Thus divide the 1M into 512k each. After that a further division of 256k each in one 512k afterward one of the 256 is divided into further 128keach and place the process in that. Similarly to that if another process enters the division and placing will continue.
Process A enters of 0k
A
128 128 256 512
Process B enters of 35k
B
.
128 64 64 256 512
Process c enters of 80k
C
128 64 64 128 128 512
Process A terminates
128
64 64 128 128 512
Process D enters of 60k
D
Process B terminates
64
64 128 128 512
Process D terminates
128 128 512
Process C terminates
512
Subsequent to this all the free spaces will join together. Later than the two adjacent processes having same space completed they will combine together and at last when all the processes are over the 1M memory will get back.
Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti
Q. Which of the subsequent instructions should be privileged? a) Read the clock b) Clear memory c) Set value of timer d) Issue a trap instruction e) Turn off interr
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.
explain how response time are reduced by allowing time sharing on top of multiprogramming
What is a binary Semaphore?
draw a state diagram showing the transissions of a process from creation to termination
The following information is available for three MPS (Master Product Scheduling) items: Product A An 80 unit order is to be started in Week 3.
Explain process scheduling in time sharing The relevant features of time sharing are: 1. Process priorities do not depend on the nature of the processes 2. Proc
Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc
Q. Define Input - Output operations? Serial lines, Disks, tapes and other devices should be communicated with at a very low level. The user require only specify the device and
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