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.
what is independent process? distinguished between independent process and co-operating process
What is the main function of the memory-management unit? The runtime mapping from virtual to physical addresses is done by a hardware device known as a memory management unit (
Briefly explain process management in Windows 2000. The Windows 2000 process manager provides for deleting, creating and using threads and processes. It has no knowledge about
Explain the ThreadSwitch function used in the netware Since NetWare 3 and 4 are nonpreemptive environments, it may be necessary for the application developer to explicitly reli
There is a process bloacked by a semaphore and no other process in the ready queue, can the blocked process get back to the ready queue without the semsignal() function?
Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are
Introduction of linux
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.
Explain the Fork-join This is primitives in a higher level programming language for implementing interacting processes. The syntax is like this: fork ; join ; where
What is co-operating scheduling? CPU scheduling decisions may possibly place under the following four circumstances: 1. When process switches from the running state to
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