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
381. The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to
- Zero
- One
- Two
- Three
382. In memory management Free page list as : A-A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification.
- A, B, C are true
- A and B are true
- A and C are true
- B and C are true
383. A policy in memory management referred as clock policy because one can vasualize the page frames as laid out in
- Straight line
- Rectangle
- Circle
- Square
384. In memory management : A-Fixed allocation policy, B-Variable allocation polocy: 1-it gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-It a number of allocated frames are decided at initial load time.
- A-1, 3, B-2
- A-2, B-1, 3
- A-2, B-1, 3
- A-1, 2, B-3
385. In uni-processor scheduling : A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
- A-2,2, B-3
- A-1, 3, B-2
- A-2, B-1, 2
- A-2, B-1, 3
386. In uni-processor management processor through put
- Is a measure of how much work is being performed
- Is the percentage of time that the processor is busy
- is a time interval between the submission of a process and its completion
- None of these
387. In uni-pricessor scheduling, if non-preemptive policy is applied then
- Once a processor is in running state, it continues to execute until it terminates or blck itself.
- Currently running process can be interrupted and moved to ready state by the operating system
- The clock interrupt is generated at periodic intervals.
- None of these
388. In aperiodic (real time) tasks
- The dead line for start is mandatory, but for finish it is not.
- The dead line for finish is mandatry, but for start it is not.
- The dead line for finish and start is mandatory.
- The dead line for finish and start is not mandatory
389. The times table of railway, and airline which defines arrival and departure can be considered as
- Hard real time scheduling
- Soft real time scheduling
- None real time scheduling
- None of these
390. When preemptive policy is applied to uni-processor scheduling then
- Once a process is in running state, it continues to execute until it terminates or block itself.
- Currently running process can be interrupted and rmoved to ready state by the operating system
- The processes are assigned priorites.
- None of these