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. Presume that the following processes arrive for execution at the times indicated. Every process will run the listed amount of time. In responding the questions use non pre-emptive scheduling and base all decisions on the information you have at the time the decision must be made.
a. What is the average revolve time for these processes with the FCFS scheduling algorithm?
b. What is the average revolve time for these processes with the SJF scheduling algorithm?
c. The SJF algorithm is supposed to improve performance however notice that we chose to run process P1 at time 0 because we did not know that two shorter processes would arrive soon. Calculate what the average turnaround time will be if the CPU is left idle for the first unit and then SJF scheduling is used. Keep in mind that processes P1 and P2 are waiting during this idle time thus their waiting time may increase. This algorithm could be recognized as future-knowledge scheduling.
Answer:
a. 10.53
b. 9.53
c. 6.86
Keep in mind that turnaround time is finishing time minus arrival time so you have to subtract the arrival times to compute the turnaround times. FCFS is 11 if you overlook to subtract arrival time.
WHAT IS OPERATING SYSTEM ?ENLIST AND EXPLAIN BASIC SERVICES PROVIDE BY OS
Q. How does NTFS handle data structures? How does NTFS recover from a system crash? What is guaranteed after a recovery takes place? Answer: In NTFS all file-system data stru
4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p
The objects that a program can access directly are those objects which are referenced by local vari-ables on the processor stack, or by any global/static variables that refer to ob
DESCRIBE OPERATING SYSTEM
This assignment is based on Programming Project 6.40 in Silbershatz. Implement the ProducerXConsumer program according to the instructions for Project 6.40 for both Linux and Win32
Question: (a) The following table (table 1.0) gives the length of the CPU burst time in milliseconds of processes P 1 to P 4 . Assume the processes arrived in the order P 1 ,
how it is work.
Multi-level page tables are tree-like structures to hold page tables. As an example, consider a two- level page table, again on a 32-bit architecture with 212 = 4 kbyte pages. Now,
(a) Describe services of operating systems. (b) Differentiate among the short term, medium term and long term scheduling that are given by multi-tasking operating systems.
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