MCQs / Computer Science / NSCT: Operating Systems

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

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.

76. The SCAN disk scheduling algorithm is also called the:

  1. Shortest seek algorithm
  2. Elevator algorithm
  3. FIFO algorithm
  4. Round robin disk

Answer: B) Elevator algorithm

Explanation: The head sweeps back and forth like a lift. Lesson 9.4 · Operating Systems

Discuss this question

77. Which symbolic permission string is equivalent to chmod 700?

  1. rwxrwxrwx
  2. rwx------
  3. rwxrwx---
  4. ------rwx

Answer: B) rwx------

Explanation: Each digit maps to rwx bits: 700 → rwx------. Lesson 9.4 · Operating Systems

Discuss this question

78. Processes arrive at time 0 with burst times P1 = 8, P2 = 4, P3 = 9, P4 = 5 ms. What is the average waiting time under non-pre-emptive SJF?

  1. 10.25 ms
  2. 14 ms
  3. 7.5 ms
  4. 9.5 ms

Answer: C) 7.5 ms

Explanation: Order by burst; waiting times [9, 0, 17, 4] → average 7.5 ms. Lesson 9.2 · Operating Systems

Discuss this question

79. Processes arrive at time 0 with burst times P1 = 10, P2 = 2, P3 = 6 ms. What is the average waiting time under non-pre-emptive SJF?

  1. 9.33 ms
  2. 5.33 ms
  3. 3.33 ms
  4. 7.33 ms

Answer: C) 3.33 ms

Explanation: Order by burst; waiting times [8, 0, 2] → average 3.33 ms. Lesson 9.2 · Operating Systems

Discuss this question

80. A situation where the result depends on the timing of concurrent threads accessing shared data is a:

  1. Deadlock
  2. Race condition
  3. Context switch
  4. Page fault

Answer: B) Race condition

Explanation: Proper synchronisation prevents it. Lesson 9.3 · Operating Systems

Discuss this question

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

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

Answer: B) 6

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

Discuss this question

82. Which is NOT one of the four necessary conditions for deadlock?

  1. Pre-emption
  2. Hold and wait
  3. Mutual exclusion
  4. Circular wait

Answer: A) Pre-emption

Explanation: The condition is "no pre-emption". Lesson 9.3 · Operating Systems

Discuss this question

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

  1. 8.5 ms
  2. 3 ms
  3. 5.25 ms
  4. 3.25 ms

Answer: C) 5.25 ms

Explanation: Waiting times [0, 3, 6, 12] → average 5.25 ms. Lesson 9.2 · Operating Systems

Discuss this question

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

  1. 5
  2. 8
  3. 10
  4. 7

Answer: D) 7

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

Discuss this question

85. Which symbolic permission string is equivalent to chmod 600?

  1. rw-rw----
  2. rw-------
  3. ------rw-
  4. rwxrwxrwx

Answer: B) rw-------

Explanation: Each digit maps to rwx bits: 600 → rw-------. Lesson 9.4 · Operating Systems

Discuss this question

86. A process that has terminated but whose parent has not yet read its exit status is a:

  1. Orphan process
  2. Daemon
  3. Zombie process
  4. Thread

Answer: C) Zombie process

Explanation: It remains in the process table. Lesson 9.1 · Operating Systems

Discuss this question

87. A system has 20-bit logical addresses and 2 KB pages. How many entries are in a single-level page table?

  1. 512
  2. 256
  3. 1,024
  4. 1,048,576

Answer: A) 512

Explanation: 2^20 ÷ 2048 = 512 pages. Lesson 9.4 · Operating Systems

Discuss this question

88. With a page size of 4096 bytes, what are the page number and offset of logical address 70000?

  1. Page 18, offset 368
  2. Page 17, offset 3728
  3. Page 17, offset 368
  4. Page 368, offset 17

Answer: C) Page 17, offset 368

Explanation: 70000 ÷ 4096 = 17 remainder 368. Lesson 9.4 · Operating Systems

Discuss this question

89. Processes arrive at time 0 in order with burst times P1 = 10, P2 = 2, P3 = 6 ms. What is the average turnaround time under FCFS?

  1. 9.33 ms
  2. 18 ms
  3. 7.33 ms
  4. 13.33 ms

Answer: D) 13.33 ms

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

Discuss this question

90. Choosing the smallest free memory hole that is big enough is:

  1. Next fit
  2. First fit
  3. Best fit
  4. Worst fit

Answer: C) Best fit

Explanation: It leaves the smallest leftover hole. Lesson 9.4 · Operating Systems

Discuss this question

91. TLB lookup takes 20 ns, memory access 100 ns, and the TLB hit ratio is 80%. What is the effective memory access time?

  1. 140 ns
  2. 120 ns
  3. 150 ns
  4. 220 ns

Answer: A) 140 ns

Explanation: EAT = 0.8×(20+100) + 0.20×(20+2×100) = 140 ns. Lesson 9.4 · Operating Systems

Discuss this question

92. RAID 1 provides redundancy by:

  1. Compressing data
  2. Deleting duplicates
  3. Striping without parity
  4. Mirroring data on two disks

Answer: D) Mirroring data on two disks

Explanation: If one disk fails, the mirror has a copy. Lesson 9.4 · Operating Systems

Discuss this question

93. With 4 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. 12
  2. 10
  3. 6
  4. 8

Answer: D) 8

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

Discuss this question

94. The theoretical best page replacement algorithm replaces the page:

  1. Used least recently
  2. That will not be used for the longest time in the future
  3. Loaded first
  4. With the smallest number

Answer: B) That will not be used for the longest time in the future

Explanation: Optimal (Belady's) algorithm. Lesson 9.4 · Operating Systems

Discuss this question

95. Linux uses which kernel design?

  1. Exokernel
  2. Monolithic
  3. Microkernel
  4. No kernel

Answer: B) Monolithic

Explanation: Most services run in kernel space. Lesson 9.1 · Operating Systems

Discuss this question

96. TLB lookup takes 10 ns, memory access 80 ns, and the TLB hit ratio is 75%. What is the effective memory access time?

  1. 90 ns
  2. 100 ns
  3. 170 ns
  4. 110 ns

Answer: D) 110 ns

Explanation: EAT = 0.75×(10+80) + 0.25×(10+2×80) = 110 ns. Lesson 9.4 · Operating Systems

Discuss this question

97. The TLB (Translation Lookaside Buffer) is used to:

  1. Speed up virtual-to-physical address translation
  2. Schedule processes
  3. Encrypt memory
  4. Store files

Answer: A) Speed up virtual-to-physical address translation

Explanation: It caches recent page-table entries. Lesson 9.4 · Operating Systems

Discuss this question

98. Saving the state of one process and loading another is a:

  1. Page fault
  2. Deadlock
  3. Context switch
  4. System call

Answer: C) Context switch

Explanation: It is overhead – no useful work is done. Lesson 9.1 · Operating Systems

Discuss this question

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

  1. 7
  2. 5
  3. 10
  4. 8

Answer: A) 7

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

Discuss this question

100. Which scheduler is most suitable for interactive time-sharing systems?

  1. Batch priority
  2. FCFS
  3. Round Robin
  4. Non-pre-emptive SJF

Answer: C) Round Robin

Explanation: It gives every user quick, fair response. Lesson 9.2 · Operating Systems

Discuss this question

Previous Page 4 of 5 Next

Practise NSCT: Operating Systems MCQs

More Computer Science chapters