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. Most WANs utilize only a partially connected topology. Why is this subsequently Answer: Cost. A completely connected network requires a link between every node in the netw
What are the various scheduling criteria for CPU scheduling? The various scheduling criteria are CPU utilization
Write note on process, process state? A process is in excess of the program code which is sometimes known as text section. It as well includes the current activity as represent
Determine the reasons for Poor response time Process busy or High I/O rates or High paging rates
What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.
bootstrap
Define swapping. A process requires being in memory to be executed. Though a process can be swapped temporarily out of memory to a backing store and then brought back into memo
Another solution then would be to keep a pool of threads. Whenever a new task arrives, the system would simply get a thread from pool and set that thread to work on the given task.
Q. Why High level languages need Compiler? High level languages - illustrations are COBOL, FORTRAN, PL/I andALGOL - are processed by interpreters andcompilers. A compilers is a
what are the overall concepts of deadlock
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