Introduction To Operating Systems NPTEL Week 5 Assignment

                     

These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment

Course Name: Introduction To Operating Systems

Link of course: Click here


Q1)

These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment
These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment

The average turnaround time with the shortest remaining time first (SRTF) and shortest job first (SJF) scheduling for the seven processes listed in the table is ___________
a. 10 and 13.4
b. 12 and 14.5
c. 11 and 13.4
d. 12 and 13.4

Answer: c. 11 and 13.4


Q2) Consider the context switching overhead of 1 unit. What is the context switching overhead while using SRTF and SJF scheduling for the seven processes listed in the table above. Include the context switching to load the first process?
a. 10 and 6
b. 11 and 7
c. 11 and 6
d. 10 and 7

Answer: b. 11 and 7


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment


Q3) For the processes listed in the table above, the schedule length is  _____________ with a FCFS scheduling scheme

Answer: 29


Consider 3 processes that start simultaneously. Each process from start to finish takes 40, 50, and 60  ms respectively. Of this, the first 20% of the time is spent waiting for IO events and the next 80% time for computation


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment


Q4) The scheduler uses FCFS scheduling. Assuming that all I/O operations are overlapped. How much time in milli-seconds is the CPU idle?
a. 8 ms
b. 16 ms
c. 18 ms
d. 40 ms

Answer: c. 18 ms


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment


Q5) From the data given above, which of the following is the average turn around time considering only the time when a process is either running or in the ready queue?
a. 42 ms
b. 62 ms
c. 72 ms
d. 82 ms

Answer: c. 72 ms


Q6) For the data given above, the schedule length is  _____________ assuming SRTF scheduling algorithm

Answer: 120


Q7) Shortest Remaining Time first algorithm is not practical
   Its time complexity is huge, which makes it unsuitable for real systems
   It requires knowledge of the burst time, which can be easily predicted

a. True,True
b. True,False
c. False,True
d. False,False

Answer: b. True,False


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment


Consider three process P1, P2, and P3 with arrival time (0, 1, 3) and burst time (6 ,5,4) respectively, what is the order of completion in SJF and RR scheduling with time slice of 2 units

Q8) Order of completion in SJF scheduling
a. SJF: P2 P3 P1 
b. SJF: P1 P2 P3 
c. SJF: P1 P2 P3
d. SJF: P1 P3 P2

Answer: a. SJF: P2 P3 P1 


Q9) Order of Completion in RR scheduling
a. RR: P1 P2 P3
b. RR: P1 P2 P3
c. RR: P2 P1 P3
d. RR: P1 P3 P2

Answer: d. RR: P1 P3 P2


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment


Q10) Professor X suggests a method to alleviate starvation in scheduling algorithms. Under the new scheme, processes get a priority number.
The priority of the process is considered by the scheduling algorithm when scheduling. The new scheme will alleviate starvation

a. True
b. False

Answer: a. True


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment

All weeks of Introduction To Operating Systems: https://progies.in/answers/nptel/introduction-to-operating-systems

More NPTEL Solutions: https://progies.in/answers/nptel


* The material and content uploaded on this website are for general information and reference purposes only. Please do it by your own first.


These are solution for Introduction To Operating Systems NPTEL Week 5 Assignment