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
511. A monitor program is a program that
- interprets the iterrupt calls
- restres the status of the CPU after a function call
- interprets the input from akeyboard and converts the input into it binary equivalent
- checks the status of the I/O devices
512. The process sheduler in the processor management unit
- gives ll jobs to the job scheduler
- selects a job to run
- selects a process to run
- co-ordinates the process synchronization
513. Round robin is a
- kind of magnetic drum
- process scheduling policy
- process synchronization policy
- memory allocation policy
514. Which is the correct definition of a valid prcess transittion in an operating system ?
- Wake up: ready ? running
- Dispatch : ready ? running
- Block : ready ? running
- Timer runout : ready ? blocked
515. A critical section is a program segment
- Which should run in a certain specified amount of time.
- Which avoids deadlocks
- Where shared resources are accessed
- which mut be encolsed by a pair of semaphore operations.
516. Which of the following is an example of a spooled device ?
- A line printer used to print the output of a nummber of jobs
- A terminal used to enter input data to a running program
- A secondary storage device in a virtual memory system
- A graphic display device.
517. A solution to the Dining Philosophers probemswhich avoids deadlock is
- ensure that all philosophers pick up the left fork before the right fork
- ensure that all philosophers pick up the right fork beforre the left fork.
- ensure that one partcular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork.
- None of the above
518. Locality f reference implies that the page reference being made by a process
- will always be to the page used in the previous page reference
- ensure that all philosophers pick up the right fork before the left fork.
- Ensure that one partiular philosopher picks up the left fork before the right fork,and all other philosophers pick up the right fork before the left fork.
- None of the above
519. Locality of reference implies that the page reference being made by a process
- will always be to the page used in the previous page reference.
- is likely to be to one of the pages used in the last few page references
- will always be to one of the pages existing in memory
- will always lead to a page fault.
520. The correct matching for the following pairs is - (A) Disk suchduling, (1) Round robin, (B) Batch processing, (2) SCAN, (C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO
- A-2, B-4, C-1, D-3
- A-1, B-2, C-3, D-4
- A-2, B-1, C-4, D-3
- None of these