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?
Since each thread has its own processing space therefore communication between threads will need to be done through a common global variable. Since multiple threads can access the
What is a two state process model? At any time a process is being implementing by a processor or not. Therefore a process may be in Running or not running state. When an Ope
Q. What kind of operating system is Windows XP? Describe two of its major features. Answer: A 32 or 64 bit pre-emptive multitasking operating system supporting multiple use
Define where a Program generation activity aims Program generation activity aims at Automatic generation of program
time-stamping It is a method proposed by Lamport, used to sequencing events in a distributed machine without the use of clocks. This process is intended to order events consis
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
Using pages makes it easier to manage the whole memory, avoiding excessive fragmentation and waste. As an analogy, think of Tetris, but with only square blocks: it is relatively ea
The term ‘page traffic’ explains Page traffic’ explains the movement of pages in and out of memory.
Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no
What are the various file operations? The six basic file operations are Creating a file Reading a file Writing a file Repositioning within a file Tr
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd