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: Shortest seek algorithm Elevator algorithm FIFO algorithm 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? rwxrwxrwx rwx------ rwxrwx--- ------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? 10.25 ms 14 ms 7.5 ms 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? 9.33 ms 5.33 ms 3.33 ms 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: Deadlock Race condition Context switch 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? 9 6 12 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? Pre-emption Hold and wait Mutual exclusion 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? 8.5 ms 3 ms 5.25 ms 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? 5 8 10 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? rw-rw---- rw------- ------rw- 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: Orphan process Daemon Zombie process 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? 512 256 1,024 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? Page 18, offset 368 Page 17, offset 3728 Page 17, offset 368 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? 9.33 ms 18 ms 7.33 ms 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: Next fit First fit Best fit 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? 140 ns 120 ns 150 ns 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: Compressing data Deleting duplicates Striping without parity 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? 12 10 6 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: Used least recently That will not be used for the longest time in the future Loaded first 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? Exokernel Monolithic Microkernel 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? 90 ns 100 ns 170 ns 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: Speed up virtual-to-physical address translation Schedule processes Encrypt memory 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: Page fault Deadlock Context switch 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? 7 5 10 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? Batch priority FCFS Round Robin 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