MCQs / Computer Science / NSCT: Operating Systems

NSCT: Operating Systems MCQs — Computer Science (page 5)

111 multiple-choice questions on NSCT: Operating Systems from Computer Science, each with the correct answer and, where available, a teacher's explanation. Read through them to revise the chapter, then practise the same questions one by one to test yourself.

101. Processes arrive at time 0 in order with burst times P1 = 4, P2 = 7, P3 = 3, P4 = 2 ms. What is the average turnaround time under FCFS?

  1. 16 ms
  2. 11.25 ms
  3. 7.25 ms
  4. 8 ms

Answer: B) 11.25 ms

Explanation: Turnaround = waiting + burst for each process; average them. Lesson 9.2 · Operating Systems

Discuss this question

102. Processes arrive at time 0 in order with burst times P1 = 3, P2 = 5, P3 = 2, P4 = 4 ms. Using Round Robin with a quantum of 2 ms, what is the average waiting time?

  1. 9 ms
  2. 5.25 ms
  3. 7 ms
  4. 4 ms

Answer: C) 7 ms

Explanation: Waiting times [6, 9, 4, 9] → average 7 ms. Lesson 9.2 · Operating Systems

Discuss this question

103. With 3 frames (initially empty), how many page faults occur for the reference string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 using LRU replacement?

  1. 7
  2. 10
  3. 9
  4. 12

Answer: B) 10

Explanation: Simulating LRU gives 10 faults (FIFO 9, LRU 10, Optimal 7). Lesson 9.4 · Operating Systems

Discuss this question

104. Processes arrive at time 0 in the order P1, P2, …, with burst times P1 = 5, P2 = 8, P3 = 2, P4 = 4 ms. What is the average waiting time under FCFS?

  1. 13 ms
  2. 9.25 ms
  3. 4.75 ms
  4. 8.25 ms

Answer: D) 8.25 ms

Explanation: Waiting times [0, 5, 13, 15] → average 8.25 ms. Lesson 9.2 · Operating Systems

Discuss this question

105. A process that is loaded and waiting only for the CPU is in the:

  1. New state
  2. Waiting state
  3. Ready state
  4. Terminated state

Answer: C) Ready state

Explanation: The scheduler picks from the ready queue. Lesson 9.1 · Operating Systems

Discuss this question

106. Processes arrive at time 0 in the order P1, P2, …, with burst times P1 = 6, P2 = 3, P3 = 1 ms. What is the average waiting time under FCFS?

  1. 3.33 ms
  2. 8.33 ms
  3. 5 ms
  4. 1.67 ms

Answer: C) 5 ms

Explanation: Waiting times [0, 6, 9] → average 5 ms. Lesson 9.2 · Operating Systems

Discuss this question

107. Processes arrive at time 0 in the order P1, P2, …, with burst times P1 = 8, P2 = 4, P3 = 9, P4 = 5 ms. What is the average waiting time under FCFS?

  1. 6.5 ms
  2. 16.75 ms
  3. 7.5 ms
  4. 10.25 ms

Answer: D) 10.25 ms

Explanation: Waiting times [0, 8, 12, 21] → average 10.25 ms. Lesson 9.2 · Operating Systems

Discuss this question

108. The pre-emptive version of SJF is:

  1. FCFS
  2. Lottery scheduling
  3. Round Robin
  4. Shortest Remaining Time First

Answer: D) Shortest Remaining Time First

Explanation: A new shorter job can pre-empt the running one. Lesson 9.2 · Operating Systems

Discuss this question

109. The dining philosophers problem illustrates:

  1. CPU scheduling only
  2. Deadlock and resource allocation among concurrent processes
  3. File allocation
  4. Memory paging

Answer: B) Deadlock and resource allocation among concurrent processes

Explanation: Each philosopher needs two forks. Lesson 9.3 · Operating Systems

Discuss this question

110. Processes arrive at time 0 in order with burst times P1 = 4, P2 = 6, P3 = 2 ms. Using Round Robin with a quantum of 3 ms, what is the average waiting time?

  1. 8.67 ms
  2. 2.67 ms
  3. 4.67 ms
  4. 5.67 ms

Answer: D) 5.67 ms

Explanation: Waiting times [5, 6, 6] → average 5.67 ms. Lesson 9.2 · Operating Systems

Discuss this question

111. Two processes keep changing state in response to each other but neither makes progress. This is:

  1. Thrashing
  2. Livelock
  3. Deadlock
  4. Starvation

Answer: B) Livelock

Explanation: Unlike deadlock, they are not blocked. Lesson 9.3 · Operating Systems

Discuss this question

Previous Page 5 of 5

Practise NSCT: Operating Systems MCQs

More Computer Science chapters