NPTEL Introduction to Operating Systems Week 5 Assignment Answers 2024

1. State True/False:

I. I/O bound processes have the lower scheduling priority compared to CPU bound processes as they are dependent on I/Os
II. A process can behave as both CPU and I/O bound processes.

I- True ,II- False
I- False ,II- False
I- False ,II- True
I- True ,II- True

Answer :- For Answers Click Here

2. Average Waiting Time and Average Response Time are independent of the sequence in which the processes are executed in a first come first serve scheduling algorithm.

True
False

Answer :- For Answers Click Here

3. Match the following

I. FCFS i. Optimal Waiting Time
II. SJF ii. Convoy effect
III. Round Robin iii. Not practical
IV. SRTF iv. No Starvation

I – ii, II – i, III – iv, IV – iii
I – i, II – ii, III – iv, IV – iii
I – iii, II – i, III – iv, IV – ii
I – iii, II – iv, III – i, IV – i

Answer :- For Answers Click Here

4. State True/False:

I. For the processes to be seen as concurrent the time slice should be as high as possible
II. xv6 scheduling policy is the best in terms of prioritizing processes

I – True II – False
I – True II – True
I – False II – False
I – False II – True

Answer :-

5. Ageing is a solution for starvation in priority scheduling

True
False

Answer :-

6. Processes like MS excel which can be both CPU bound and I/O bound are the best for Multi-level Queues

True
False

Answer :- For Answers Click Here

7. 4 processes A,B,C,D have estimated burst times of 4,5,6,7 ns respectively. They are scheduled in round robin fashion and the time slice is of 2 ns. The processes A,B,C,D arrive at the 0,0.5,1,1.5 ns respectively. How long would it take for all processes to complete? ___________ ns

Answer :-

8. 4 processes A,B,C,D have estimated burst times of 4,5,6,7 ns respectively. They are scheduled in round robin fashion and the time slice is of 2 ns. The processes A,B,C,D arrive at the 0,0.5,1,1.5 ns respectively. At what time will process B finish?__________________ ns

Answer :-

9. 4 processes A,B,C,D have estimated burst times of 4,5,6,7 ns respectively. They are scheduled in round robin fashion and the time slice is of 2 ns. The processes A,B,C,D arrive at the 0,0.5,1,1.5 ns respectively. The order in which the processes are completed.