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!
Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters to define the number of queues the scheduling algorithms for every queue the criteria used to move processes between queues and so on. These algorithms are consequently really sets of algorithms for instance the set of RR algorithms for all time slices and so on. One set of algorithms may comprise another (for instance the FCFS algorithm is the RR algorithm with an infinite time quantum).What (if any) relation embraces between the following pairs of sets of algorithms?
1 Priority and SJF
2 Multilevel feedback queues and FCFS
3 Priority and FCFS
4 RR and SJF
Answer:
1 The shortest job has the highest priority
2 The lowest level of MLFQ is FCFS.
3 FCFS provides the highest priority to the job having been in existence the longest.
4 None.
Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta
Introduction of linux
Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers
Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to
what is the meaning of co-operating process?
Worst Fit Algorithm Here we obtain the largest space available for the smallest. Therefore after that process entered there will be much more space remaining. In this space we
best fit
Define the properties of Interactive operating system Interactive:- This system is composed of many short transactions where the results of the next transaction may be unpred
protection in paging
Safety algorithm : This is to make sure if the system is in safe state or not. It may need an order of m x n2 operation to determine if the state of the system is safe or not.
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