Introduction to Operating System | NPTEL | Week 5 Answers

This set of MCQ(multiple choice questions) focuses on the Introduction to Operating System NPTEL Week 5 Answers

You should practice these questions to improve fundamentals of Cyber security needed for various interviews (like company interview, campus interview, walk-in interview), entrance exams, placements and other competitive exams. All the questions in this particular section are based on only “Introduction to Operating System NPTEL Week 5 Answers“.

Course layout

Week 1: Assignment solutions
Week 2:
Assignment solutions
Week 3:
Assignment solutions
Week 4: Assignment solutions

Week 5: Assignment Solutions
Week 6: Assignment solutions
Week 7: Assignment solutions
Week 8: Assignment solutions
Week 9: Assignment solutions
Week 10: Assignment solutions
Week 11: Assignment solutions
Week 12: Assignment solutions

NOTE: You can check your answer immediately by clicking show answer button. Moreover, this set of Introduction to Operating System NPTEL Week 5 Answers” contains 10 questions.

Now, start attempting the quiz.

Introduction to Operating System NPTEL Week 5 Answers

Q1. The data structure best suitable for implementing Round Robin Scheduling is

a) Stack
b) Queue
c) List
d) Array

Answer: b) Queue

Introduction to Operating System NPTEL Week 5 Answers

Q2. What does Turn around time mean ?

a) Time from the process enters the ready queue to the time it starts execution.
b) The difference between the arrival time and the completion time of the process.
c) Time taken from start to completion of I/O
d) Time  a process waits in the ready queue.

Answer: b)

Introduction to Operating System NPTEL Week 5 Answers


a. O(n) scheduler 1)has 2 run queues to prevent starvation
b. O(1) scheduler 2)Set based on priority of the process
c. Time Slice of a process 3)is based on average sleeping time
d. Dynamic Priority 4) Not scalable to large number of processes

a) a-3, b-1 c-4, d-2
b) a-3, b-4,c-1, d-3
c) a-4, b-1, c-2, d-3
d) a-4, b-3, c-2, d -1

Answer: c) a-4, b-1, c-2, d-3

Introduction to Operating System NPTEL Week 5 Answers

Q4. Preemption is

a) forced deallocation of the CPU from a program which is executing on the CPU.
b) release of CPU by the program after completing its task.
c) forced allocation of CPU by a program to itself.
d) a program terminating itself due to detection of an error.

Answer: a)

Introduction to Operating System NPTEL Week 5 Answers

Q5. Which of the following scheduling algorithms is not preemptive?

b) Round robin
d) Ideal Fair scheduling

Answer: a) FCFS

Q6. State if the following statement is True or False.
A system can have more than one scheduling algorithm at a time

a) True
b) False

Answer: a) True

Q7. Shortest Remaining Time first algorithm is not practical
a. Its time complexity is huge, which makes it unsuitable for real systems
b. It requires knowledge of the burst time, which is not easy to predict

a) True, True
b) True, False
c) False, True
d) False, False

Answer: c) False, True

Introduction to Operating System NPTEL Week 5 Answers

Q8. Answer the following questions (8 and 9)
What is the Schedule length of the following process.(used FCFS scheduling)

a) 10
b) 16
c) 19
d) 20

Answer: d) 20

Q9. With respect to the table given above, which of the following is False?

a) The order of execution is same in FCFS and SRTF
b) The average waiting time is same for FCFS and SJF
c) The CPU idle time is 2 units
d) None of these

Answer: d) None of these

Q10. Consider a set of process A, B, C, D arriving in the same order at time zero in the ready queue. Their burst times are 4, 1, 8, 1 respectively. Using Round Robin scheduling, with time slice of 1 unit. What is the time at which process A completes execution?

a) 4
b) 5
c) 9
d) 12

Answer: c) 9

Introduction to Operating System NPTEL Week 5 Answers

Q11. 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

a) SJF: P1 P3 P2  RR: P1 P2 P3
b) SJF:  P1 P2 P3 RR: P1 P2 P3
c) SJF:  P1 P2 P3 RR: P2 P1 P3
d) SJF:  P1 P3 P2 RR: P1 P3 P2

Answer: d)

Q12. Let the base priority of a system be 130 and the nice value provided is -10. What is the time slice that the process gets in the O(1) scheduling algorithm?

a) 100
b) 200
c) 300
d) 400

Answer: a) 100

Q13. Consider 3 Process, arriving at time zero, with total execution time of 40, 50, 60  ms respectively. Each process spends the first 40% of execution time doing I/O operation and the next 60% time for computations. The scheduler uses FCFS scheduling. Assuming that all I/O operations are overlapped. How much time in ms the CPU is idle?

a) 16 ms
b) 24 ms
c) 60 ms
d) None of these

Answer: a) 16 ms

Q14. From the data given in Question 13, what is the average turn around time?

a) 32 ms
b) 48 ms
c) 52 ms
d) 72 ms

Answer: c) 52 ms

Introduction to Operating System NPTEL Week 5 Answers

Q15. A process is provided with a bonus of 4 in the O(1) scheduling algorithm. The dynamic priority of the process ____________.

Answer: 121

<< Prev- Introduction to Operating System Week 4 Assignment Solutions

>> Next- Introduction to Operating System Week 6 Assignment Solutions

DISCLAIMER: Use these answers only for the reference purpose. Quizermania doesn't claim these answers to be 100% correct. So, make sure you submit your assignments on the basis of your knowledge.

Programming in Java NPTEL week 1 quiz answers

Nptel – Deep Learning assignment solutions

For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.

Leave a Comment

Your email address will not be published. Required fields are marked *