99. Process is
● A program in execution
● A job in secondary memory
● Contents of main memory
● Program in High level language kept on disk
● a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
100. A task in a blocked state
● is waiting for same temporarily unavailable resources
● must still be placed in the run queues
● is executable
● is running
101. The systems which allows only one process execution at a time, are called
● unicasting systems
● uniprogramming systems
● uniprocessing systems
● unitasking systems
102. The state of a process is defined by:
● the current activity of the process
● the activity to next be executed by the process
● the final activity of the process
● the activity is just executed by the process
103. Which of the following is not the state of a process?
● ready
● Old
● terminated
● running
● new
104. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
● Suspended state
● Terminated state
● Running state
● Ready state
105. Which of the following state transitions is not possible?
● ready to running
● blocked to ready
● running to blocked
● blocked to running
106. If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
● synchronous exclusion
● mutual exclusion
● asynchronous exclusion
● critical exclusion
107. Interprocess communication:
● allows processes to communicate and synchronize their actions without using the same address space
● allows processes to communicate and synchronize their actions when using the same address space
● allows the processes to only synchronize their actions without communication
● none of the above
08. A sequence of instructions, in a computer language, to get the desired result, is known as?
● program
● process
● instruction
● algorithm
109. In operating system, each process has its own:
● program code
● set of data
● address space and global variables
● all of the mentioned
110. For each process OS creates and manages:
● Thread control block
● Program
● Program code
● Process control block
111. Listing the sequence of instructions that are executed is called?
● control block
● program counter
● trace
112. A process can be terminated due to:
● killed by another process
● normal exit
● fatal error
113. What is the ready state of a process?
● when process is unable to run until some task has been completed
● when process is using CPU
● when process is scheduled to run after some execution
114. What is interprocess communication?
● communication within the process
● communication between two threads of same process
● communication between two process
115. A set of processes is deadlock if:
● each process is terminated
● all processes are trying to kill each other
● each process is blocked and will remain so forever
116. The address of the next instruction to be executed by the current process is provided by the:
● process stack
● CPU registers
● pipe
117. A Process Control Block (четыре вопроса в одном)PCB) doesn’t contain which of the following:
● code
● bootstrap program
● process state
● data
● stack
118. The Process Control Block is:
● secondary storage section
● block in memory
● data structure
● process type variable
119. The degree of multi-programming is:
● the number of processes in memory
● the number of processes in the ready queue
● the number of processes in the I/O queue
● the number of processes executed per unit time
120. A single thread of control allows the process to perform:
● multiple tasks at a time
● only one task at a time
● both
121. The objective of multi-programming is to:
● to minimize CPU utilization
● to maximize CPU utilization
● have multiple programs waiting in a queue ready to run
122. What is a long-term scheduler?
● it selects which process has to remove from memory by swapping
● it selects which process has to be brought into the ready queue
● it selects which process has to be executed next and allocates CPU
123. What is a medium-term scheduler?
124. What is a short-term scheduler?
125. The primary distinction between the short-term scheduler and the longterm scheduler is:
● the frequency of their execution
● the type of processes the schedule
● the length of their queues
126. In a multi-programming environment:
● a single user can execute many programs at the same time
● more than one process resides in the memory
● the programs are developed by more than one person
● the processor executes more than one process at a time
127. The context of a process in the PCB of a process DOESN’T contain:
● the value of the CPU registers
● memory-management information
● the process state
● context switch time
128. Which of the following state transitions is not possible?
129. Which process can be affected by other processes executing in the system?
● parent process
● child process
● cooperating process
● init process
130. Which one of the following is a synchronization tool?
● Semaphore
● thread
● socket
131. Mutual exclusion can be provided by the:
● binary semaphores
● mutex locks
● none of the abovemaint
132. When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:
● priority modification
● priority removal
● priority inversion
● priority exchange
133. With ……………. 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.
● Multiprogramming, Multiprocessing
Multiprogramming, Uniprocessing
● Uniprogramming, Multiprocessing
● Multiprocessing, multiprogramming
134. Interprocess communication allows:
● is required for all processes
● is usually done via disk drives
● is never necessary
● allows process to synchronize activity
135. Message passing system allows processes to:
● communicate with one another by resorting shared data
● name the recipient or sender of the message
communicate with one another without resorting to shared data
● share data
136. The link between two processes P and Q to send and receive messages is called:
● synchronization link
● communication link
● all of the above
● message-passing link
137. In indirect communication between processes P and Q:
● there is another process R to handle and pass on the messages between P and Q
● there is another machine between the two processes to help communication
● there is a mailbox to help communication between P and Q
138. In the non-blocking send:
● the sending process keeps sending until it receives a message
● the sending process keeps sending until the message is received
● the sending process sends the message and resumes operation
139. In the blocking send, blocking receive:
● the sending process sends the message while receiver is blocked
● both sender and receiver are blocked until message is delivered
140. In the non-blocking send, blocking receive:
● sender continues on, receiver is blocked until the requested message arrives
141. In the non-blocking send, non-blocking receive:
● neither of processes are required to wait
142. Remote Procedure Calls (четыре вопроса в одном)RPC) are used:
● for communication between two processes remotely different from each other on the same system
● for communication between two processes on the same systems
● for communication between two processes on separate systems
143. What is a trap/exception?
● software generated interrupt caused by an error
● hardware generated interrupt caused by an error
● failure of the system
● user generated interrupt caused by an error
144. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:
● 2
● 1
● 0
● 10
145. The initial value of the semaphore that allows only one of the many processes to enter their critical sections, is?
146. Semaphores:
● synchronize critical resources to prevent contention
● are used to do I/O
● synchronize critical resources to prevent deadlock
● are used for memory management
147. Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
● starvation
● hold and wait
● deadlock avoidance
● race condition
148. Part of a program where the shared memory is accessed and which should be executed invisibly, is called:
● directory
● critical section
● semaphores
149. Banker's algorithm for resource allocation deals with:
● deadlock recovery
● deadlock prevention
150. A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
● Process synchronization
● Shared memory segments
● Race section
● Entry section
