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
251. Relative address in memory management is
- Independent of some known point
- Dependent to some known point
- Actual location in the main memory
- None of these
252. A Absolute loading B Re-locatable loading D Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader , load modules have alll memory reference in relative form.
- A-1, B-2, C-3
- A-2, B-3, C-1
- A-1, B-3, C-2
- A-3, B-2, C-1
253. For load-time dynamic linking
- Load module (application module) to be loaded is read into memory.
- Some of the linking is postponed until execution time.
- External reference to target modules remain in the loaded program.
- None of these
254. In thread schedulling, load sharing is referred to
- Simultaneous schedulling of threads that make up a single process.
- Implicit scheduling defined by the assigment of threads to processors
- A global queue of ready thread is maintained and each processor, when idle, selects a thread from queue.
- None of these
255. The real time task
- The tasks that reacts to events that take place in out side world.
- The tasks that do not reacts to the outside world events.
- The tasks are independent of the time when it occurs
- None of these
256. Hard real-time tasks are
- A real time task that do not require dead line constraints
- A real time task that requires dead the constraints
- A task independent to time when it occurs
- None of these
257. The deterministic operating system
- where operations are performed with in pre-determined time interval.
- Where operations can be performed with out pre-determined time interval.
- The operating time can not be determined.
- None of these
258. Responsive real time operating system
- The interruption is acknowledge system operating system response to interrupt.
- Once the operation starts no interrupt is acknowedge
- The operation completes in fixed inter of time
- None of these
259. In multi processor schedulling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered furing the occurs of execution. 2- This provides implicit scheduling defined by the assignment of threads ot 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
260. 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 considered
- None of these