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