Deck 2: Operating System and Process Management: Part A

Question 1

Which of the following do not belong to queues for processes ?

A)job queue
B)pcb queue
C)device queue
D)ready queue

Answer 1

pcb queue

Question 2

When the process issues an I/O request :

A)it is placed in an i/o queue
B)it is placed in a waiting queue
C)it is placed in the ready queue
D)it is placed in the job queue

Answer 2

it is placed in an i/o queue

Question 3

What is a long-term scheduler ?

A)it selects which process has to be brought into the ready queue
B)it selects which process has to be executed next and allocates cpu
C)it selects which process to remove from memory by swapping
D)none of these

Answer 3

it selects which process has to be brought into the ready queue

Question 4

If all processes I/O bound, the ready queue will almost always be ______, and the Short term Scheduler will have a ______ to do.

A)full,little
B)full,lot
C)empty,little
D)empty,lot

Question 5

What is a medium-term scheduler ?

A)it selects which process has to be brought into the ready queue
B)it selects which process has to be executed next and allocates cpu
C)it selects which process to remove from memory by swapping
D)none of these

Question 6

What is a short-term scheduler ?

A)it selects which process has to be brought into the ready queue
B)it selects which process has to be executed next and allocates cpu
C)it selects which process to remove from memory by swapping
D)none of these

Question 7

The primary distinction between the short term scheduler and the long term scheduler is :

A)the length of their queues
B)the type of processes they schedule
C)the frequency of their execution
D)none of these

Question 8

The only state transition that is initiated by the user process itself is :

A)block
B)wakeup
C)dispatch
D)none of these

Question 9

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 :

A)blocked state
B)ready state
C)suspended state
D)terminated state

Question 10

In a multi-programming environment :

A)the processor executes more than one process at a time
B)the programs are developed by more than one person
C)more than one process resides in the memory
D)a single user can execute many programs at the same time

Question 11

Suppose that a process is in "Blocked" state waiting for some I/O service. When the service is completed, it goes to the :

A)running state
B)ready state
C)suspended state
D)terminated state

Question 12

An unrecoverable error is known as _________.

A)hard error
B)tough error
C)soft error
D)none of these

Question 13

Which of the following need not necessarily be saved on a context switch between processes ? (GATE CS 2000)

A)general purpose registers
B)translation look-aside buffer
C)program counter
D)all of these

Question 14

Which of the following does not interrupt a running process ? (GATE CS 2001)

A)a device
B)timer
C)scheduler process
D)power failure

Question 15

the access takes place, is called a(n) ____.

A)shared memory segments
B)entry section
C)race condition
D)process synchronization

Question 16

Which of the following state transitions is not possible ?

A)blocked to running
B)ready to running
C)blocked to ready
D)running to blocked

Question 17

Which module gives control of the CPU to the process selected by the short-term scheduler?

A)dispatcher
B)interrupt
C)scheduler
D)none of the mentioned

Question 18

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

A)job queue
B)ready queue
C)execution queue
D)process queue

Question 19

The interval from the time of submission of a process to the time of completion is termed as

A)waiting time
B)turnaround time
C)response time
D)throughput

Question 20

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

A)first-come, first-served scheduling
B)shortest job scheduling
C)priority scheduling
D)none of the mentioned

Question 21

In priority scheduling algorithm

A)cpu is allocated to the process with highest priority
B)cpu is allocated to the process with lowest priority
C)equal priority processes can not be scheduled
D)none of the mentioned

Question 22

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of

A)all process
B)currently running process
C)parent process
D)init process

Question 23

Time quantum is defined in

A)shortest job scheduling algorithm
B)round robin scheduling algorithm
C)priority scheduling algorithm
D)multilevel queue scheduling algorithm