Question 1
Answer
-
● 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
Question 2
Question
100. A task in a blocked state
Question 3
Question
101. The systems which allows only one process execution at a time, are
called
Answer
-
● unicasting systems
-
● uniprogramming systems
-
● uniprocessing systems
-
● unitasking systems
Question 4
Question
102. The state of a process is defined by:
Answer
-
● 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
Question 5
Question
103. Which of the following is not the state of a process?
Answer
-
● ready
-
● Old
-
● terminated
-
● running
-
● new
Question 6
Question
104. Suppose that a process is in “Blocked” state waiting for some I/O
service. When the service is completed, it goes to the:
Answer
-
● Suspended state
-
● Terminated state
-
● Running state
-
● Ready state
Question 7
Question
105. Which of the following state transitions is not possible?
Answer
-
● ready to running
-
● blocked to ready
-
● running to blocked
-
● blocked to running
Question 8
Question
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
Answer
-
● synchronous exclusion
-
● mutual exclusion
-
● asynchronous exclusion
-
● critical exclusion
Question 9
Question
107. Interprocess communication:
Answer
-
● 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
Question 10
Question
08. A sequence of instructions, in a computer language, to get the desired
result, is known as?
Answer
-
● program
-
● process
-
● instruction
-
● algorithm
Question 11
Question
109. In operating system, each process has its own:
Question 12
Question
110. For each process OS creates and manages:
Answer
-
● Thread control block
-
● Program
-
● Program code
-
● Process control block
Question 13
Question
111. Listing the sequence of instructions that are executed is called?
Answer
-
● control block
-
● instruction
-
● program counter
-
● trace
Question 14
Question
112. A process can be terminated due to:
Question 15
Question
113. What is the ready state of a process?
Answer
-
● when process is unable to run until some task has been completed
-
● when process is using CPU
-
● none of the above
-
● when process is scheduled to run after some execution
Question 16
Question
114. What is interprocess communication?
Answer
-
● communication within the process
-
● none of the above
-
● communication between two threads of same process
-
● communication between two process
Question 17
Question
115. A set of processes is deadlock if:
Answer
-
● each process is terminated
-
● all processes are trying to kill each other
-
● none of the above
-
● each process is blocked and will remain so forever
Question 18
Question
116. The address of the next instruction to be executed by the current
process is provided by the:
Answer
-
● process stack
-
● CPU registers
-
● program counter
-
● pipe
Question 19
Question
117. A Process Control Block (четыре вопроса в одном)PCB) doesn’t contain which of the following:
Answer
-
● code
-
● bootstrap program
-
● process state
-
● data
-
● stack
Question 20
Question
118. The Process Control Block is:
Question 21
Question
119. The degree of multi-programming is:
Answer
-
● 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
Question 22
Question
120. A single thread of control allows the process to perform:
Question 23
Question
121. The objective of multi-programming is to:
Answer
-
● to minimize CPU utilization
-
● to maximize CPU utilization
-
● have multiple programs waiting in a queue ready to run
Question 24
Question
122. What is a long-term scheduler?
Answer
-
● it selects which process has to remove from memory by swapping
-
● it selects which process has to be brought into the ready queue
-
● none of the above
-
● it selects which process has to be executed next and allocates CPU
Question 25
Question
123. What is a medium-term scheduler?
Answer
-
● it selects which process has to remove from memory by swapping
-
● it selects which process has to be brought into the ready queue
-
● none of the above
-
● it selects which process has to be executed next and allocates CPU
Question 26
Question
124. What is a short-term scheduler?
Answer
-
● it selects which process has to remove from memory by swapping
-
● it selects which process has to be brought into the ready queue
-
● none of the above
-
● it selects which process has to be executed next and allocates CPU
Question 27
Question
125. The primary distinction between the short-term scheduler and the longterm scheduler is:
Answer
-
● the frequency of their execution
-
● the type of processes the schedule
-
● none of the above
-
● the length of their queues
Question 28
Question
126. In a multi-programming environment:
Answer
-
● 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
Question 29
Question
127. The context of a process in the PCB of a process DOESN’T contain:
Question 30
Question
128. Which of the following state transitions is not possible?
Answer
-
● ready to running
-
● blocked to ready
-
● running to blocked
-
● blocked to running
Question 31
Question
129. Which process can be affected by other processes executing in the
system?
Answer
-
● parent process
-
● child process
-
● cooperating process
-
● init process
Question 32
Question
130. Which one of the following is a synchronization tool?
Answer
-
● Semaphore
-
● pipe
-
● thread
-
● socket
Question 33
Question
131. Mutual exclusion can be provided by the:
Answer
-
● binary semaphores
-
● both
-
● mutex locks
-
● none of the abovemaint
Question 34
Question
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:
Answer
-
● priority modification
-
● priority removal
-
● priority inversion
-
● priority exchange
Question 35
Question
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.
Answer
-
● Multiprogramming, Multiprocessing
-
Multiprogramming, Uniprocessing
-
● Uniprogramming, Multiprocessing
-
● Multiprocessing, multiprogramming
Question 36
Question
134. Interprocess communication allows:
Answer
-
● is required for all processes
-
● is usually done via disk drives
-
● is never necessary
-
● allows process to synchronize activity
Question 37
Question
135. Message passing system allows processes to:
Answer
-
● 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
Question 38
Question
136. The link between two processes P and Q to send and receive messages
is called:
Answer
-
● synchronization link
-
● communication link
-
● all of the above
-
● message-passing link
Question 39
Question
137. In indirect communication between processes P and Q:
Answer
-
● 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
-
● none of the above
-
● there is a mailbox to help communication between P and Q
Question 40
Question
138. In the non-blocking send:
Answer
-
● none of the above
-
● 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
Question 41
Question
139. In the blocking send, blocking receive:
Answer
-
● the sending process sends the message while receiver is blocked
-
● the sending process sends the message and resumes operation
-
● none of the above
-
● both sender and receiver are blocked until message is delivered
Question 42
Question
140. In the non-blocking send, blocking receive:
Answer
-
● none of the above
-
● the sending process keeps sending until it receives a message
-
● sender continues on, receiver is blocked until the requested message arrives
-
● the sending process sends the message and resumes operation
Question 43
Question
141. In the non-blocking send, non-blocking receive:
Answer
-
● the sending process sends the message and resumes operation
-
● the sending process keeps sending until the message is received
-
● neither of processes are required to wait
-
● the sending process keeps sending until it receives a message
Question 44
Question
142. Remote Procedure Calls (четыре вопроса в одном)RPC) are used:
Answer
-
● 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
-
● none of the above
Question 45
Question
143. What is a trap/exception?
Answer
-
● 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
Question 46
Question
144. To avoid the race condition, the number of processes that may be
simultaneously inside their critical section is:
Question 47
Question
145. The initial value of the semaphore that allows only one of the many
processes to enter their critical sections, is?
Question 48
Question
146. Semaphores:
Answer
-
● synchronize critical resources to prevent contention
-
● are used to do I/O
-
● synchronize critical resources to prevent deadlock
-
● are used for memory management
Question 49
Question
147. Four necessary conditions for deadlock to exist are: mutual exclusion,
no-preemption, circular wait and
Answer
-
● starvation
-
● hold and wait
-
● deadlock avoidance
-
● race condition
Question 50
Question
148. Part of a program where the shared memory is accessed and which
should be executed invisibly, is called:
Answer
-
● directory
-
● critical section
-
● mutual exclusion
-
● semaphores
Question 51
Question
149. Banker's algorithm for resource allocation deals with:
Answer
-
● deadlock avoidance
-
● deadlock recovery
-
● mutual exclusion
-
● deadlock prevention
Question 52
Question
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: