MCQ on operating system for gate | Operating system MCQ by Galvin pdf part 3

01) A reusable resource that can be used by ____ process at a time and is not depleted by that use.

  1. one
  2. two
  3. three
  4. none of the above

Correct answer: one process

02) The number of resources requested by a process ____ the total number of resources available in the system.

  1. must not exceed
  2. must always
  3. larger memory sized systems
  4. none of the above

Correct answer: multiprogramming

03) Round robin scheduling falls under the category of _____

  1. non-preemptive scheduling
  2. preemptive scheduling
  3. none of the above

Correct answer: preemptive scheduling

04) Which is the most optimal scheduling algorithm?

  1. SJF – [Shortest Job First]
  2. FCFS – [First Come First Served]
  3. RR – [Round Robin]
  4. None of the above

Correct answer: SJF – [Shortest Job First]

05) Concurrent access to shared data may result in data _____

  1. Insecurity
  2. Consistency
  3. Inconsistency
  4. None of the above

Correct answer: Inconsistency

06) An un-interruptible unit is known as _____

  1. single
  2. atomic
  3. static
  4. none of the above

Correct answer: atomic

07) What will happen if a non-recursive mutex is locked more than once?

  1. aging
  2. static
  3. deadlock
  4. starvation

Correct answer: deadlock

08) _____ problem is also known as producer-consumer problem

  1. Readers-writers problem
  2. Dining-philosophers problem
  3. Bounded buffer
  4. none of the above

Correct answer: Bounded buffer

09) A monitor is a type of ___ level synchronization construct

  1. high
  2. low
  3. standard
  4. None of the above

Correct answer: High

10) A collection of instructions that performs a ______ function is called transaction.

  1. single logical
  2. double logical
  3. hash
  4. All of the above

Correct answer: single logical