Operating System Basics Questions and Answers

Take Exam

Operating System Basics questions with answers are among the most commonly asked in technical interviews and exams. This section covers core OS concepts like process management, memory allocation, file systems, and scheduling algorithms. Practicing programming questions and answers on operating systems helps strengthen your conceptual clarity and practical understanding of computer architecture. Frequently featured in GATE, TCS, Infosys, and Wipro placements, these MCQs provide a balanced mix of theoretical and applied knowledge. Clear explanations make this section an ideal resource for anyone preparing for system-related roles or competitive exams.

Operating System Basics

Showing 10 of 563 questions

111. In memory management , a technique called as paging, physical memory is broken into fixed-sized blocks called ___________.

  • Pages
  • Frames
  • Blocks
  • Segments
Show Answer Report

112. The state of a process after it encounters an I/O instruction is __________.

  • Ready
  • Blocked/Waiting
  • Idle
  • Running
Show Answer Report

113. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock

  • Mutual exclusion
  • Hold and Wait
  • Circular Wait
  • No Preemption
Show Answer Report

114. Which of the following file name extension suggests that the file is Backup copy of another file ?

  • TXT
  • COM
  • BAS
  • BAK
Show Answer Report

115. The degree of Multiprogramming is controlled by

  • CPU Scheduler
  • Context Switching
  • Long-term Scheduler
  • Medium term Scheduler
Show Answer Report

116. The higher versions of operating systems are so written that programs designed for earlier versions can still be run. What is it called ?

  • Up gradiability
  • Upward mobility
  • Universality
  • Upward Compatibility
Show Answer Report

117. A scheduling algorithm is fair

  • if no process faces starvation
  • if a process is starved, detect it and run it with high priority
  • if it uses semaphores
  • only if a queue is used for scheduling
Show Answer Report

118. A critical region

  • is a piece of code which only one process executes at a time
  • is a region prone to deadlock
  • is a piece of code which only a finite number of processes execute
  • is found only in Windows NT operation system
Show Answer Report

119. Semaphore can be used for solving __________.

  • Wait & signal
  • Deadlock
  • Synchronization
  • Priority
Show Answer Report

120. The operating system of a computer serves as a software interface between the user and the ________.

  • Hardware
  • Peripheral
  • Memory
  • Screen
Show Answer Report
Questions and Answers for Competitive Exams Various Entrance Test