MCQs / Computer Science / NSCT: Operating Systems
NSCT: Operating Systems MCQs — Computer Science (page 3) 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.
51. Which symbolic permission string is equivalent to chmod 751? rwxr-x--x --xr-xrwx rwxrwxrwx rwxrwx--x Answer: A) rwxr-x--x
Explanation: Each digit maps to rwx bits: 751 → rwxr-x--x. Lesson 9.4 · Operating Systems
Discuss this question
52. If the Round Robin time quantum is very small: Throughput increases greatly Processes never run Context-switch overhead becomes very high It becomes SJF Answer: C) Context-switch overhead becomes very high
Explanation: Too many switches waste CPU time. Lesson 9.2 · Operating Systems
Discuss this question
53. In Java, mutual exclusion on a method can be achieved with the keyword: volatile only static final synchronized Answer: D) synchronized
Explanation: It acquires the object's monitor lock. Lesson 9.3 · Operating Systems
Discuss this question
54. Paging eliminates: External fragmentation Virtual memory The need for RAM Internal fragmentation Answer: A) External fragmentation
Explanation: Any free frame can hold any page. Lesson 9.4 · Operating Systems
Discuss this question
55. Which scheduling algorithm gives the minimum average waiting time (for known burst times)? FCFS Round Robin Priority with random priorities Shortest Job First Answer: D) Shortest Job First
Explanation: Running short jobs first reduces total waiting. Lesson 9.2 · Operating Systems
Discuss this question
56. The producer–consumer problem is also called the: Dining philosophers problem Banker's problem Readers–writers problem Bounded-buffer problem Answer: D) Bounded-buffer problem
Explanation: Producers wait when full; consumers wait when empty. Lesson 9.3 · Operating Systems
Discuss this question
57. A page fault occurs when: A file is deleted A process finishes The CPU overheats A needed page is not in main memory Answer: D) A needed page is not in main memory
Explanation: The OS loads the page from disk. Lesson 9.4 · Operating Systems
Discuss this question
58. Which symbolic permission string is equivalent to chmod 644? rw-r--r-- rwxrwxrwx rw-rw-r-- r--r--rw- Answer: A) rw-r--r--
Explanation: Each digit maps to rwx bits: 644 → rw-r--r--. Lesson 9.4 · Operating Systems
Discuss this question
59. 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 Optimal replacement? 12 6 10 8 Answer: B) 6
Explanation: Simulating Optimal gives 6 faults (FIFO 10, LRU 8, Optimal 6). Lesson 9.4 · Operating Systems
Discuss this question
60. Processes arrive at time 0 in order with burst times P1 = 3, P2 = 3, P3 = 6, P4 = 1 ms. What is the average turnaround time under FCFS? 8.5 ms 6.25 ms 5.25 ms 13 ms Answer: A) 8.5 ms
Explanation: Turnaround = waiting + burst for each process; average them. Lesson 9.2 · Operating Systems
Discuss this question
61. Short processes waiting behind one long process in FCFS is called: Aging Thrashing Convoy effect Starvation Answer: C) Convoy effect
Explanation: Average waiting time rises. Lesson 9.2 · Operating Systems
Discuss this question
62. Fixed-size partitions where the last page or block is not fully used cause: Thrashing External fragmentation Deadlock Internal fragmentation Answer: D) Internal fragmentation
Explanation: Wasted space inside an allocated unit. Lesson 9.4 · Operating Systems
Discuss this question
63. With 3 frames (initially empty), how many page faults occur for the reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3 using FIFO replacement? 6 9 10 8 Answer: B) 9
Explanation: Simulating FIFO gives 9 faults (FIFO 9, LRU 8, Optimal 6). Lesson 9.4 · Operating Systems
Discuss this question
64. A system has 32-bit logical addresses and 4 KB pages. How many entries are in a single-level page table? 524,288 1,048,576 2,097,152 4,294,967,296 Answer: B) 1,048,576
Explanation: 2^32 ÷ 4096 = 1,048,576 pages. Lesson 9.4 · Operating Systems
Discuss this question
65. If the Round Robin time quantum is very large, it behaves like: SJF FCFS Priority scheduling Multilevel queue Answer: B) FCFS
Explanation: Each process finishes within its quantum. Lesson 9.2 · Operating Systems
Discuss this question
66. TLB lookup takes 10 ns, memory access 100 ns, and the TLB hit ratio is 90%. What is the effective memory access time? 120 ns 210 ns 110 ns 130 ns Answer: A) 120 ns
Explanation: EAT = 0.9×(10+100) + 0.10×(10+2×100) = 120 ns. Lesson 9.4 · Operating Systems
Discuss this question
67. 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 Optimal replacement? 10 7 9 12 Answer: B) 7
Explanation: Simulating Optimal gives 7 faults (FIFO 9, LRU 10, Optimal 7). Lesson 9.4 · Operating Systems
Discuss this question
68. The page replacement algorithm that replaces the page used least recently is: LRU Random FIFO Optimal Answer: A) LRU
Explanation: Least Recently Used. Lesson 9.4 · Operating Systems
Discuss this question
69. A program in execution is called a: Process Compiler Thread library File Answer: A) Process
Explanation: A process has code, data, stack and registers. Lesson 9.1 · Operating Systems
Discuss this question
70. Compared with creating a new process, creating a thread is: Impossible on Linux The same in every way Faster and uses fewer resources Slower Answer: C) Faster and uses fewer resources
Explanation: Threads share their process's address space. Lesson 9.1 · Operating Systems
Discuss this question
71. Processes arrive at time 0 in the order P1, P2, …, with burst times P1 = 4, P2 = 7, P3 = 3, P4 = 2 ms. What is the average waiting time under FCFS? 4 ms 8.25 ms 7.25 ms 11.25 ms Answer: C) 7.25 ms
Explanation: Waiting times [0, 4, 11, 14] → average 7.25 ms. Lesson 9.2 · Operating Systems
Discuss this question
72. With 3 frames (initially empty), how many page faults occur for the reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3 using LRU replacement? 6 10 9 8 Answer: D) 8
Explanation: Simulating LRU gives 8 faults (FIFO 9, LRU 8, Optimal 6). Lesson 9.4 · Operating Systems
Discuss this question
73. Which symbolic permission string is equivalent to chmod 640? ---r--rw- rw-rw---- rw-r----- rwxrwxrwx Answer: C) rw-r-----
Explanation: Each digit maps to rwx bits: 640 → rw-r-----. Lesson 9.4 · Operating Systems
Discuss this question
74. RAID 0 offers: Faster performance but no fault tolerance Parity protection Mirroring Automatic backups Answer: A) Faster performance but no fault tolerance
Explanation: Striping across disks. Lesson 9.4 · Operating Systems
Discuss this question
75. Ignoring deadlocks and rebooting when they occur is called the: Banker's algorithm Ostrich algorithm Peterson's solution Aging technique Answer: B) Ostrich algorithm
Explanation: Used by most desktop OSs because deadlocks are rare. Lesson 9.3 · Operating Systems
Discuss this question
Previous Page 3 of 5 Next
Practise NSCT: Operating Systems MCQs
More Computer Science chapters