OSG202

B

Inter process communication : a) allows processes to communicate and synchronize their actions when using the same address space. b) allows processes to communicate and synchronize their actions without using the same address space. c) allows the processes to only synchronize their actions without communication. d) None of these

H

A Process Control Block(PCB) does not contain which of the following : a) Code b) Stack c) Heap d) Data e) Program Counter f) Process State g) I/O status information h) bootstrap program

D

A monitor is a module that encapsulates a) shared data structures b) procedures that operate on shared data structure c) synchronization between concurrent procedure invocation d) all of the mentioned

A

A parent process calling _____ system call will be suspended until children processes terminate. a) wait b) fork c) exit d) exec

D

A process can be terminated due to a) normal exit b) fatal error c) killed by another process d) all of the mentioned

C

A process is selected from the ______ queue by the ________ scheduler, to be executed. a) blocked, short term b) wait, long term c) ready, short term d) ready, long term

D

A process stack does not contain a) function parameters b) local variables c) return addresses d) PID of child process

A

A semaphore is a shared integer variable a) that can not drop below zero b) that can not be more than zero c) that can not drop below one d) that can not be more than one

A

Message passing system allows processes to : a) communicate with one another without resorting to shared data. b) communicate with one another by resorting to shared data. c) share data d) name the recipient or sender of the message

C

Messages sent by a process : a) have to be of a fixed size b) have to be a variable size c) can be fixed or variable sized d) None of these

C

Mutual exclusion can be provided by the a) mutex locks b) binary semaphores c) both (a) and (b) d) none of the mentioned

D

Process are classified into different groups in a) shortest job scheduling algorithm b) round robin scheduling algorithm c) priority scheduling algorithm d) multilevel queue scheduling algorithm

C

Process synchronization can be done on a) hardware level b) software level c) both (a) and (b) d) none of the mentioned

B

Response time is : a) the total time taken from the submission time till the completion time b) the total time taken from the submission time till the first response is produced c) the total time taken from submission time till the response is output d) None of these

C

Restricting the child process to a subset of the parent's resources prevents any process from : a) overloading the system by using a lot of secondary storage b) under-loading the system by very less CPU utilization c) overloading the system by creating a lot of sub-processes d) crashing the system by utilizing multiple resources

A

Scheduling is done so as to : a) increase CPU utilization b) decrease CPU utilization c) keep the CPU more idle d) None of these

A

Scheduling is done so as to : a) increase the throughput b) decrease the throughput c) increase the duration of a specific amount of work d) None of these

A

A single thread of control allows the process to perform : a) only one task at a time b) multiple tasks at a time c) All of these

C

An I/O bound program will typically have : a) a few very short CPU bursts b) many very short I/O bursts c) many very short CPU bursts d) a few very short I/O bursts

CD

An IPC facility provides atleast two operations : (choose two) a) write message b) delete message c) send message d) receive message

B

Bounded capacity and Unbounded capacity queues are referred to as : a) Programmed buffering b) Automatic buffering c) User defined buffering d) No buffering

C

By operating system, the resource management can be done via a) time division multiplexing b) space division multiplexing c) both (a) and (b) d) none of the mentioned

B

CPU scheduling is the basis of ____________. a) multiprocessor systems b) multiprogramming operating systems c) larger memory sized systems d) None of these

A

Cascading termination refers to termination of all child processes before the parent terminates ______. a) Normally b) Abnormally c) Normally or abnormally d) None of these

C

Dispatch latency is : a) the speed of dispatching a process from running to the ready state b) the time of dispatching a process from running to ready state and keeping the CPU idle c) the time to stop one process and start running another one d) None of these

A

If a process fails, most operating system write the error information to a a) log file b) another running process c) new file d) none of the mentioned

A

If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called a) mutual exclusion b) critical exclusion c) synchronous exclusion d) asynchronous exclusion

C

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

C

In UNIX, each process is identified by its : a) Process Control Block b) Device Queue c) Process Identifier d) None of these

C

In UNIX, the return value for the fork system call is _____ for the child process and _____ for the parent process. a) A Negative integer, Zero b) Zero, A Negative integer c) Zero, A nonzero integer d) A nonzero integer, Zero

A

In Unix, Which system call creates the new process? a) fork b) create c) new d) none of the mentioned

C

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

B

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

C

In indirect communication between processes P and Q : a) there is another process R to handle and pass on the messages between P and Q b) there is another machine between the two processes to help communication c) there is a mailbox to help communication between P and Q d) None of these

A

In multilevel feedback scheduling algorithm a) a process can move to a different classified ready queue b) classification of ready queue is permanent c) processes are not classified into groups d) none of the mentioned

D

In operating system, each process has its own a) address space and global variables b) open files c) pending alarms, signals and signal handlers d) all of the mentioned

A

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

B

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

AB

In the Zero capacity queue : (choose two) a) the queue has zero capacity b) the sender blocks until the receiver receives the message c) the sender keeps sending and the messages dont wait in the queue d) the queue can store atleast one message

BD

In the following cases non - preemptive scheduling occurs : (Choose two) a) When a process switches from the running state to the ready state b) When a process goes from the running state to the waiting state c) When a process switches from the waiting state to the ready state d) When a process terminates

B

In the non blocking send : a) the sending process keeps sending until the message is received b) the sending process sends the message and resumes operation c) the sending process keeps sending until it receives a message d) None of these

B

Scheduling is done so as to : a) increase the turnaround time b) decrease the turnaround time c) keep the turnaround time same d) there is no relation between scheduling and turnaround time

C

Scheduling is done so as to : a) increase the waiting time b) keep the waiting time the same c) decrease the waiting time d) None of these

C

Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) ____. a) Shared Memory Segments b) Entry Section c) Race condition d) Process Synchronization

B

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

B

The OS X has a) monolithic kernel b) hybrid kernel c) microkernel d) monolithic kernel with modules

B

The Process Control Block is : a) Process type variable b) Data Structure c) a secondary storage section d) a Block in memory

B

The Zero Capacity queue : a) is referred to as a message system with buffering b) is referred to as a message system with no buffering c) is referred to as a link d) None of these

B

The address of the next instruction to be executed by the current process is provided by the a) CPU registers b) program counter c) process stack d) pipe

AC

The child process can : (choose two) a) be a duplicate of the parent process b) never be a duplicate of the parent process c) have another program loaded into it d) never have another program loaded into it

B

The child process completes execution,but the parent keeps executing, then the child process is known as : a) Orphan b) Zombie c) Body d) Dead

D

The context of a process in the PCB of a process does not contain : a) the value of the CPU registers b) the process state c) memory-management information d) context switch time

D

ith ................ only one process can execute at a time; meanwhile all other process are waiting for the processor. With .............. more than one process can be running simultaneously each on a different processor. a) Multiprocessing, Multiprogramming b) Multiprogramming, Uniprocessing c) Multiprogramming, Multiprocessing d) Uniprogramming, Multiprocessing

A

set of processes is deadlock if a) each process is blocked and will remain so forever b) each process is terminated c) all processes are trying to kill each other d) none of the mentioned

AC

When a process terminates : (Choose Two) a) It is removed from all queues b) It is removed from all, but the job queue c) Its process control block is de-allocated d) Its process control block is never de-allocated

D

The degree of multi-programming is : a) the number of processes executed per unit time b) the number of processes in the ready queue c) the number of processes in the I/O queue d) the number of processes in memory

C

The entry of all the PCBs of the current processes is in : a) Process Register b) Program Counter c) Process Table d) Process Unit

B

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

A

The link between two processes P and Q to send and receive messages is called : a) communication link b) message-passing link c) synchronization link d) All of these

A

The main function of the command interpreter is a) to get and execute the next user-specified command b) to provide the interface between the API and application program c) to handle the files in operating system d) none of the mentioned

B

The number of processes completed per unit time is known as __________. a) Output b) Throughput c) Efficiency d) Capacity

AD

The objective of multi-programming is to : (choose two) a) Have some process running at all times b) Have multiple programs waiting in a queue ready to run c) To minimize CPU utilization d) To maximize CPU utilization

A

The only state transition that is initiated by the user process itself is : a) block b) wakeup c) dispatch d) None of these

C

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

B

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

D

The state of a process is defined by : a) the final activity of the process b) the activity just executed by the process c) the activity to next be executed by the process d) the current activity of the process

D

The switching of the CPU from one process or thread to another is called : a) process switch b) task switch c) context switch d) All of these

A

The systems which allows only one process execution at a time, are called a) uniprogramming systems b) uniprocessing systems c) unitasking systems d) none of the mentioned

AB

The two steps of a process execution are : (choose two) a) I/O Burst b) CPU Burst c) Memory Burst d) OS Burst

B

Time quantum is defined in a) shortest job scheduling algorithm b) round robin scheduling algorithm c) priority scheduling algorithm d) multilevel queue scheduling algorithm

A

To access the services of operating system, the interface is provided by the a) system calls b) API c) library d) assembly instructions

A

To enable a process to wait within the monitor, a) a condition variable must be declared as condition b) condition variables must be used as boolean objects c) semaphore must be used d) all of the mentioned

D

Turnaround time is : a) the total waiting time for a process to finish execution b) the total time spent in the ready queue c) the total time spent in the running queue d) the total time from the completion till the submission of a process

B

Waiting time is : a) the total time in the blocked and waiting queues b) the total time spent in the ready queue c) the total time spent in the running queue d) the total time from the completion till the submission of a process

A

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

C

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

B

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

B

What is interprocess communication? a) communication within the process b) communication between two process c) communication between two threads of same process d) none of the mentioned

D

What is operating system? a) collection of programs that manages hardware resources b) system service provider to the application programs c) link to interface the hardware and application programs d) all of the mentioned

A

What is the ready state of a process? a) when process is scheduled to run after some execution b) when process is unable to run until some task has been completed c) when process is using the CPU d) none of the mentioned

A

When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called a) priority inversion b) priority removal c) priority exchange d) priority modification

B

When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a) dynamic condition b) race condition c) essential condition d) critical condition

A

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

A

Which facility dynamically adds probes to a running system, both in user processes and in the kernel? a) DTrace b) DLocate c) DMap d) DAdd

A

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

BD

Which of the following are TRUE for direct communication :(choose two) a) A communication link can be associated with N number of process(N = max. number of processes supported by system) b) A communication link can be associated with exactly two processes c) Exactly N/2 links exist between each pair of processes(N = max. number of processes supported by system) d) Exactly one link exists between each pair of processes

B

Which of the following do not belong to queues for processes ? a) Job Queue b) PCB queue c) Device Queue d) Ready Queue

C

Which of the following does not interrupt a running process ? (GATE CS 2001) a) A device b) Timer c) Scheduler process d) Power failure

B

Which of the following is not the state of a process ? a) New b) Old c) Waiting d) Running e) Ready f) Terminated

B

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

A

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

B

Which one of the following can not be scheduled by the kernel? a) kernel level thread b) user level thread c) process d) none of the mentioned

D

Which one of the following error will be handle by the operating system? a) power failure b) lack of paper in printer c) connection failure in the network d) all of the mentioned

C

Which one of the following is a synchronization tool? a) thread b) pipe c) semaphore d) socket

D

Which one of the following is not a real time operating system? a) VxWorks b) Windows CE c) RTLinux d) Palm OS

C

Which one of the following is not true? a) kernel is the program that constitutes the central core of the operating system b) kernel is the first part of operating system to load into memory during booting c) kernel is made of various modules which can not be loaded in running operating system d) kernel remains in the memory during the entire computer session

A

Which process can be affected by other processes executing in the system? a) cooperating process b) child process c) parent process d) init process

A

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

A

Which system call returns the process identifier of a terminated child? a) wait b) exit c) fork d) get

A

With multiprogramming, ______ is used productively. a) time b) space c) money d) All of these