Advanced Operating System Set 2
On This Page
This set of Advanced Operating System Multiple Choice Questions & Answers (MCQs) focuses on Advanced Operating System Set 2
Q1 | The objective of multi-programming is to : (choose two)
- have some process running at all times
- have multiple programs waiting in a queue ready to run
- to minimize cpu utilization
- to maximize cpu utilization
Q2 | Which of the following do not belong to queues for processes ?
- job queue
- pcb queue
- device queue
- ready queue
Q3 | When the process issues an I/O request :
- it is placed in an i/o queue
- it is placed in a waiting queue
- it is placed in the ready queue
- it is placed in the job queue
Q4 | When a process terminates : (Choose Two)
- it is removed from all queues
- it is removed from all, but the job queue
- its process control block is de-allocated
- its process control block is never de-allocated
Q5 | What is a long-term scheduler ?
- it selects which process has to be brought into the ready queue
- it selects which process has to be executed next and allocates cpu
- it selects which process to remove from memory by swapping
- none of these
Q6 | If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.
- full,little
- full,lot
- empty,little
- empty,lot
Q7 | What is a medium-term scheduler ?
- it selects which process has to be brought into the ready queue
- it selects which process has to be executed next and allocates cpu
- it selects which process to remove from memory by swapping
- none of these
Q8 | What is a short-term scheduler ?
- it selects which process has to be brought into the ready queue
- it selects which process has to be executed next and allocates cpu
- it selects which process to remove from memory by swapping
- none of these
Q9 | The primary distinction between the short term scheduler and the long term scheduler is :
- the length of their queues
- the type of processes they schedule
- the frequency of their execution
- none of these
Q10 | The only state transition that is initiated by the user process itself is :
- block
- wakeup
- dispatch
- none of these
Q11 | In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :
- blocked state
- ready state
- suspended state
- terminated state
Q12 | In a multi-programming environment :
- the processor executes more than one process at a time
- the programs are developed by more than one person
- more than one process resides in the memory
- a single user can execute many programs at the same time
Q13 | Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the :
- running state
- ready state
- suspended state
- terminated state
Q14 | An unrecoverable error is known as _________.
- hard error
- tough error
- soft error
- none of these
Q15 | Which of the following need not necessarily be saved on a context switch between processes ? (GATE CS 2000)
- general purpose registers
- translation look-aside buffer
- program counter
- all of these
Q16 | Which of the following does not interrupt a running process ? (GATE CS 2001)
- a device
- timer
- scheduler process
- power failure
Q17 | the access takes place, is called a(n) ____.
- shared memory segments
- entry section
- race condition
- process synchronization
Q18 | Which of the following state transitions is not possible ?
- blocked to running
- ready to running
- blocked to ready
- running to blocked
Q19 | Which module gives control of the CPU to the process selected by the short-term scheduler?
- dispatcher
- interrupt
- scheduler
- none of the mentioned
Q20 | The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
- job queue
- ready queue
- execution queue
- process queue
Q21 | The interval from the time of submission of a process to the time of completion is termed as
- waiting time
- turnaround time
- response time
- throughput
Q22 | Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
- first-come, first-served scheduling
- shortest job scheduling
- priority scheduling
- none of the mentioned
Q23 | In priority scheduling algorithm
- cpu is allocated to the process with highest priority
- cpu is allocated to the process with lowest priority
- equal priority processes can not be scheduled
- none of the mentioned
Q24 | In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
- all process
- currently running process
- parent process
- init process
Q25 | Time quantum is defined in
- shortest job scheduling algorithm
- round robin scheduling algorithm
- priority scheduling algorithm
- multilevel queue scheduling algorithm