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?

  1. rwxr-x--x
  2. --xr-xrwx
  3. rwxrwxrwx
  4. 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:

  1. Throughput increases greatly
  2. Processes never run
  3. Context-switch overhead becomes very high
  4. 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:

  1. volatile only
  2. static
  3. final
  4. synchronized

Answer: D) synchronized

Explanation: It acquires the object's monitor lock. Lesson 9.3 · Operating Systems

Discuss this question

54. Paging eliminates:

  1. External fragmentation
  2. Virtual memory
  3. The need for RAM
  4. 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)?

  1. FCFS
  2. Round Robin
  3. Priority with random priorities
  4. 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:

  1. Dining philosophers problem
  2. Banker's problem
  3. Readers–writers problem
  4. 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:

  1. A file is deleted
  2. A process finishes
  3. The CPU overheats
  4. 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?

  1. rw-r--r--
  2. rwxrwxrwx
  3. rw-rw-r--
  4. 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?

  1. 12
  2. 6
  3. 10
  4. 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?

  1. 8.5 ms
  2. 6.25 ms
  3. 5.25 ms
  4. 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:

  1. Aging
  2. Thrashing
  3. Convoy effect
  4. 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:

  1. Thrashing
  2. External fragmentation
  3. Deadlock
  4. 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?

  1. 6
  2. 9
  3. 10
  4. 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?

  1. 524,288
  2. 1,048,576
  3. 2,097,152
  4. 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:

  1. SJF
  2. FCFS
  3. Priority scheduling
  4. 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?

  1. 120 ns
  2. 210 ns
  3. 110 ns
  4. 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?

  1. 10
  2. 7
  3. 9
  4. 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:

  1. LRU
  2. Random
  3. FIFO
  4. Optimal

Answer: A) LRU

Explanation: Least Recently Used. Lesson 9.4 · Operating Systems

Discuss this question

69. A program in execution is called a:

  1. Process
  2. Compiler
  3. Thread library
  4. 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:

  1. Impossible on Linux
  2. The same in every way
  3. Faster and uses fewer resources
  4. 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?

  1. 4 ms
  2. 8.25 ms
  3. 7.25 ms
  4. 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?

  1. 6
  2. 10
  3. 9
  4. 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?

  1. ---r--rw-
  2. rw-rw----
  3. rw-r-----
  4. 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:

  1. Faster performance but no fault tolerance
  2. Parity protection
  3. Mirroring
  4. 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:

  1. Banker's algorithm
  2. Ostrich algorithm
  3. Peterson's solution
  4. 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