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
361. In Multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1-The number of threads in a process can be altered during the course of execution. 2-This provides inplicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
- A-1, B-2, C-3
- A-2, B-1, C-3
- A-1, B-3, C-2
- A-3, B-1, C-1
362. In Real time computing
- The result of computation does not depend on the time at which computation is done.
- The result of computation also depends on the time at which computation is done.
- The results are independent of the time cnsidered.
- None of these
363. In soft real time tasks
- The dead line is always mandatory.
- The Dead line is desireable but not mandatory.
- The results are independent of the time, When it took place
- None of these
364. In real time scheduling: A: Static table driven approach, B: Static Priority driven preemptive approach, C: Dynamic planning based approach; 1-A Static analysis of feasible scheduler of dispatching is done and implemented. 2-A Static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasiblity is determined at run time.
- A-1, B-2, C-3
- A-2, B-3, C1
- A-3, B-1, C-2
- None of these
365. Match the following I/O devieces: A-Keyboard, 1-Human readable, B-Disk and tape drives, 2-Communication, C-Modern, 3-Machine readable
- A-1, B-3, C-2
- A-1, B-2, C-3,
- A-3, B-2, C-1
- A-2, B-1, C-3
366. In memory management: A-Fetch Polocy B-Cleaning Policy C- Placement Policy: 1- It determnes when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.
- A-1, B-2, C-3
- A-2, B-1, C-3
- A-2, B-1, C-3
- A-3, B-1, C-2
367. In memory management when demand cleaning policy is applied
- A modified page is written before their page frames are needed to so that pages can be written out in batches.
- A page is written out to secondary memory only when it has been selected for replacement.
- A and B both true.
- None of these
368. When pre cleaning polocy is applied in memory management
- A page is written out to secondary memory only when it has been selected for replacement
- Modified pages are written before their page frames are needed so that can be written out in batches.
- A and B both true.
- None of these
369. In Virtual memory management, when local control polocy is applied
- It detemines the number of processes that are to be resident in main memory.
- It determines the number of processes that are to be resdent in virtual memory.
- it determines when a modified pages should be written out to secondary memory
- None of these.
370. In defining page table structure in virtual memory, a page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as
- One page table per process structure.
- Two level page table structure.
- Inverted page table structure.
- None of these