Operating System Basics Questions and Answers
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
241. The wait operation
- Decrements the semaphore value
- Inrements the semaphore value
- Fixes the semaphore value
- None of these
242. In semaphore, the process executing the wait is blocked if
- The semaphore value becomes negative
- The semaphore value become positive
- The semaphore value becomes non-positive
- The semaphore value becomes non-negative
243. In semaphore the process blocked by wait operation is unblocked if
- Semaphore value becomes non- negative
- Semaphore value becomes non-posiive
- Semaphore value is negative
- Semaphore value is positive
244. The compaction is the technique in memory management that is used to over come
- Internal fragmentation
- External fragmentation
- Both (A) and (B)
- None of these
245. Physical address (absolute address ) in memory partitioning is
- Actual location in main memory
- A reference to memory location independent of current assignment
- A logical address
- None of these
246. The frame
- Can hold exactly one page of data
- Can hold more than one page of data
- Can hole two page of data
- None of these
247. The page table that is maintained by operating system
- Shows frame loation for each page of the process
- Shows actural address in main memory
- Referrer memory location to memory
- None of these
248. Match the following pairs A. Logical address (1) An actual location in main memory B. Relative address (2) An address is expressed as a location relative to some known point. C. A memory location independent of the current assignment of data to memory
- A-3, B-2, C-1
- A-2, B-1, C-3
- A-3, B-1, C-2
- A-1, B-2, C-3
249. The resident set of process is
- A process that are actually in main memory at anytimes
- A process that are actually in virtual memory at any time.
- A proces that are actually in disk
- None of these
250. Physical address in memory management is
- Actual location in main memory
- Memory location independent of current assigment of data tol memory
- Memory location dependent to some known point.
- None of these