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!
Question :
a) Consider table 1.0 below, assume the processes arrived in the order P1, P2, P3, P4 at time shown and need the indicated burst time (both in milliseconds).
Create a Gantt chart for the preemptive Shortest Job First (SJF) scheduling algorithms below showing when each process will be scheduled, and also determine the average waiting time for each process.
b) Now consider table 2.0 and create the Gantt charts for each of the scheduling algorithms below showing when each process will be scheduled, and also determine the average waiting time for each of them, assuming they arrived in the following order P1, P2, P3, P4.
i. First-Come-First-Serve (FCFS) ii. Round Robin with Quantum of 2 milliseconds iii. Round Robin with time quantum of 6 milliseconds iv. Round Robin with time quantum of 9 milliseconds
c) Based on the average waiting times you calculated in part (b) above, what can be deduced about the value of the time quantum for the round robin scheduling algorithms?
d) What is the main problem with the FCFS scheme?
Q. Regard as a logical address space of eight pages of 1024 words every mapped onto a physical memory of 32 frames. a. How several bits are there in the logical address? b. H
What do you mean by best fit? Best fit allocates the smallest hole that is big sufficient. The entire list has to be searched, until it is sorted by size. This strategy creates
Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into
What are the advantages of Linked allocation? The benefits are a. No external fragmentation b. Size of the file does not require to be declared
In a multiprogramming and time sharing environment several users share the system simultaneously .what are two such problems?
As a group, you may need to make some enhancements to your development server (NOT your stable server!) It needs to be able to run the makepasswd program, which may require instal
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
What are the features of Operation Research approach?
The term Operating System (OS) is often misused. It is common, for example, for people to speak of an OS when they are in fact referring to an OS and to a set of additional applica
SEGMENTATION HARDWARE An execution to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means of segment table. Ev
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