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
391. The normalized turnaround time is
- Ratio of turnaround time to service time
- Ratio of turnaround time to waiting time
- Ratio of service time to waiting time
- Ratio of waiting to service time.
392. In uni-processor scheduling, shortest remaining time policy is
- A policy where scheduler chooses the process that has the shortest expected remaining processing time.
- A policy where scheduler discards the process that has the shortest expected remaining process time.
- A policy where process with shortest expected processing time is selected next.
- None of these
393. In round robin (time slicing) policy applied on uni-processor scheduling
- When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in first come first serve basis.
- When interrupt occurs, the currently running processes is placed in ready queue and next ready job is selected in random order.
- No interruption is entertained.
- None of these
394. If normalized turnaround time of different process are given. Then Highest response ratio next policyin uni-processor schedulding policy selected.
- The ready process with lowest normalized turnaround time.
- The ready process with lowest normalized turnaround time.
- The process with shortest expected processing time.
- The process with highest expected processing time.
395. In multi processor scheduling, independent parallelism indicates
- There is synchronization among processes at gross level.
- There is no explicit synchronization among processes.
- A parallel processing or multi tasking is done withing a single application
- None of these
396. In multi processor scheduling : A Course gained parallelism, B : Medium grained parallelism, C: Fine grained parallelism; 1-Concurrent process running on a multi programmed uni-processor. 2-Parallel processing or multi tasking is done within a single application. 3-Parallel processing is done within a single instruction stream.
- A - 1, B - 2, C - 3
- A - 2, B - 3, C - 1
- A - 3, B - 2, C - 1
- A - 1, B - 3, C - 2
397. In round robin (time slicing) policy applied on uni processor scheduling
- when a interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in queue, and next ready job is selected in First come First serve basis.
- When interrupt occurs, he currently running process is placed in ready queue and next ready job is selected in random order.
- No interruption is entertained.
- None of these.
398. In normalized turnaround time of differemt process are given. Then Highest response ratio next policy in uni processor scheduling policy selects.
- The ready process with lowest normalized turnaround time.
- The ready process with highest normalized turnaround time.
- The process with shortest expected processing time.
- The process with highest expected processing time.
399. In multi processor scheduling, independent parallelism indicates
- There is synchronization among processes at gross level.
- There is no explicit synchronization among processes.
- A parallel processing or multitasking is done within a single application.
- None of these
400. In Multi processor scheduling; A: Coarse gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism; 1-Concurrent processes running on a multi programmed uni processor, 2 Parallel processing or multi tasking is done within a single application, 3- Parallel processing is done within a single instruction stream.
- A - 1, B - 2, C - 3
- A - 2, B - 3, C - 1
- A - 3, B - 2, C - 1
- A - 1, B - 3, C - 2