20491035
Descripción
Test por hoffa HOFFMAN, actualizado hace más de 1 año
|
Creado por hoffa HOFFMAN
hace casi 7 años
|
|
Pregunta 1
Pregunta
151. The segment of code in which the process may change common
variables, update tables, write into files is known as?
Respuesta
-
● critical section
-
● mutual exclusion
-
● non-critical section
-
● program
Pregunta 2
Pregunta
152. Mutual exclusion means that?
Respuesta
-
● none of the above
-
● if a process is executing in its critical section, then no other process must be executing in their critical sections
-
● if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes exclusion
-
● if a process is executing in its critical section, then other processes must be executing in their critical section
Pregunta 3
Pregunta
153. A minimum of _____ variable(четыре вопроса в одном)s) is/are required to be shared between
processes to solve the critical section problem?
Respuesta
-
● four
-
● one
-
● three
-
● two
Pregunta 4
Pregunta
154. An un-interruptible unit is known as:
Respuesta
-
● atomic
-
● static
-
● none of the above
-
● single
Pregunta 5
Pregunta
155. Semaphore is a/an _______ to solve the critical section problem?
Respuesta
-
● hardware for a system
-
● integer variable
-
● complex structure
-
● special program for a system
Pregunta 6
Pregunta
156. The two atomic operations permissible on semaphores are:
Respuesta
-
● stop
-
● hold
-
● signal
-
● wait
Pregunta 7
Pregunta
157. The code that changes the value of the semaphore is:
Respuesta
-
● critical section code
-
● none of the above
-
● remainder section code
-
● non-critical section code
Pregunta 8
Pregunta
158. The two kinds of semaphores are:
Respuesta
-
● decimal
-
● binary, counting
-
● mutex
Pregunta 9
Pregunta
159. A binary semaphore is a semaphore with integer values :
Respuesta
-
● 0.5
-
● 0
-
● -1
-
● 1
Pregunta 10
Pregunta
160. A monitor is a type of:
Respuesta
-
● semaphore
-
● low level synchronization construct
-
● high level synchronization construct
-
● none of the above
Pregunta 11
Pregunta
161. What is the reusable resource:
Respuesta
-
● that can be shared between various threads
-
● that can be used by one process at a time and is not depleted by that use
-
● that can be used by more than one process at a time
-
● none of the above
Pregunta 12
Pregunta
162. Which of the following condition is required for deadlock to be
possible?
Respuesta
-
● a process may hold allocated resources while awaiting assignment of other resources
-
● no resource can be forcibly removed from a process holding it
-
● all of the above
-
● mutual exclusion
Pregunta 13
Pregunta
163. A system is in the safe state if:
Respuesta
-
● none of the above
-
● both a and b
-
● b) there exist a safe sequence
-
● a) the system can allocate resources to each process in some order and still avoid a deadlock
Pregunta 14
Pregunta
164. Which one of the following is the deadlock avoidance algorithm?
Respuesta
-
● round-robin algorithm
-
● banker’s algorithm
-
● elevator algorithm
-
● dining philosophers problem
Pregunta 15
Pregunta
165. A problem encountered in multitasking when a process is perpetually
denied necessary resources is called:
Respuesta
-
● inversion
-
● aging
-
● deadlock
-
● starvation
Pregunta 16
Pregunta
166. The number of resources requested by a process:
Respuesta
-
● must always be less than the total number of resources available in the system
-
● must not exceed the total number of resources available in the system
-
● must always be equal to the total number of resources available in the system
-
● must exceed the total number of resources available in the system
Pregunta 17
Pregunta
167. For non-sharable resources like a printer, mutual exclusion:
Respuesta
-
● may exist
-
● must not exist
-
● none of the above
-
● must exist
Pregunta 18
Pregunta
168. A deadlock avoidance algorithm dynamically examines the __________,
to ensure that a circular wait condition can never exist.
Respuesta
-
● system storage state
-
● resource allocation state
-
● operating system
-
● resources
Pregunta 19
Pregunta
169. A state is safe, if:
Respuesta
-
● all of the above
-
● the state keeps the system protected and safe
-
● the system does not crash due to deadlock occurrence
-
● the system can allocate resources to each process in some order and still avoid deadlock
Pregunta 20
Pregunta
170. The available vector defines
Respuesta
-
● total amount of each resource NOT allocated to any process
-
● total amount of each resource allocated to all processes
-
● total amount of each resource in the system
-
● total amount of resources required for all processes
Pregunta 21
Pregunta
171. The resource vector define
Respuesta
-
● total amount of each resource NOT allocated to any process
-
● total amount of each resource allocated to all processes
-
● total amount of each resource in the system
-
● total amount of resources required for all processes
Pregunta 22
Pregunta
172. This matrix defines the current allocation to process i of the resource j
Respuesta
-
● Claim matrix
-
● Request matrix
-
● Resource matrix
-
● Allocation matrix
Pregunta 23
Pregunta
173. This matrix defines the amount of resources of type j requested by
process i
Respuesta
-
● Claim matrix
-
● Request matrix
-
● Resource matrix
-
● Allocation matrix
Pregunta 24
Pregunta
174. This matrix defines requirements of processes i for the resources j
Respuesta
-
● Claim matrix
-
● Request matrix
-
● Resource matrix
-
● Allocation matrix
Pregunta 25
Pregunta
175. The banker's algorithm is referred to as
Respuesta
-
● resource allocation refusal
-
● loan allocation denial
-
● resource allocation denial
-
● denial of service
Pregunta 26
Pregunta
176. 'Hold and wait' condition for deadlock is defined as
Respuesta
-
● Each process holds resource needed by next process in chain
-
● Process holds a resource while awaiting for other resource
-
● No resource can be forcibly removed from process holding it
-
● Only one process may use a resource at a time
Pregunta 27
Pregunta
177. 'Circular wait' condition for deadlock is defined as
Respuesta
-
● Each process holds resource needed by next process in chain
-
● Process holds a resource while awaiting for other resource
-
● No resource can be forcibly removed from process holding it
-
● Only one process may use a resource at a time
Pregunta 28
Pregunta
178. 'No preemption' condition for deadlock is defined as
Respuesta
-
● Each process holds resource needed by next process in chain
-
● Process holds a resource while awaiting for other resource
-
● No resource can be forcibly removed from process holding it
-
● Only one process may use a resource at a time
Pregunta 29
Pregunta
179. 'Mutual exclusion' condition for deadlock is defined as
Respuesta
-
● Each process holds resource needed by next process in chain
-
● Process holds a resource while awaiting for other resource
-
● No resource can be forcibly removed from process holding it
-
● Only one process may use a resource at a time
Pregunta 30
Pregunta
180. What is NOT an example of consumable resource?
Respuesta
-
● Messages
-
● Main memory
-
● Signals
-
● Information in I\O buffers
Pregunta 31
Pregunta
181. What is NOT an example of reusable resource?
Respuesta
-
● i/o channels
-
● interrupt
-
● processors
-
● semaphores
Pregunta 32
Pregunta
182. This resource can be created and destroyed
Respuesta
-
● finite resource
-
● consumable resource
-
● restartable resource
-
● resumable resource
Pregunta 33
Pregunta
183. This resource can be safely used by only one process at a time and is
not depleted by that use
Respuesta
-
● refreshing resource
-
● reusable resource
-
● replenishing resource
-
● refurbished resource
Pregunta 34
Pregunta
184. Deadlock inevitable region can be referred to as a
Respuesta
-
● false region
-
● final region
-
● fatal region
-
● fun region
Pregunta 35
Pregunta
185. This illustrates the progress of two processes competing for two
resources
Respuesta
-
● joint progress diagram
-
● joint regress diagram
-
● joint ingres diagram
-
● joint process diagram
Pregunta 36
Pregunta
186. When each process in the set is blocked awaiting for resource siezed by
another blocked process
Respuesta
-
● it is a mortallock
-
● it is a softlock
-
● it is a deadlock
-
● it is a deadend
Pregunta 37
Pregunta
187. Which of the following statements is false:
Respuesta
-
● internal fragmentation is increased with small pages
-
● a small page size causes large page tables
-
● a large page size causes instructions and data that will not be referenced brought into primary storage
-
● I\O transfers are more efficient with large pages
-
● the system must stop everything while it performs the compaction
-
● compaction is also known as garbage collection
-
● the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
-
● compaction does not involve relocation of programs
Pregunta 38
Pregunta
188. Memory is:
Respuesta
-
● is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
-
● is a device that performs a sequence of operations specified by instructions in memory
-
● is a sequence of the instructions
-
● is the device where information stored
Pregunta 39
Pregunta
189. Processor is:
Respuesta
-
● is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
-
● is a device that performs a sequence of operations specified by instructions in memory
-
● is a sequence of the instructions
-
● is the device where information stored
Pregunta 40
Pregunta
190. Program is:
Respuesta
-
● is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
-
● is a device that performs a sequence of operations specified by instructions in memory
-
● is a sequence of the instructions
-
● is the device where information stored
Pregunta 41
Pregunta
191. The memory allocation scheme subject to "external" fragmentation is?
Respuesta
-
● pure demand paging
-
● multiple contiguous fixed partitionings
-
● swapping
-
● segmentation
Pregunta 42
Pregunta
192. The memory allocation scheme subject to "internal" fragmentation is?
Respuesta
-
● pure demand paging
-
● multiple contiguous fixed partitionings
-
● swapping
-
● segmentation
Pregunta 43
Pregunta
193. Any program, no matter how small, will occupy an entire partition
results in?
Respuesta
-
● external fragmentation
-
● paging
-
● segmentation
-
● internal fragmentation
Pregunta 44
Pregunta
194. How to solve problem of equal-size partitions?
swapping (?) ----- page 318 book
Respuesta
-
● virtual memory segmentation
-
● compaction
-
● segmentation
-
● unequal-size partitions
Pregunta 45
Pregunta
195. How to solve problem of "external" fragmentation?
Respuesta
-
● none of these
-
● smaller memory space
-
● larger memory space
-
● compaction
Pregunta 46
Pregunta
196. A page fault?
Respuesta
-
● is an error is a specific page
-
● is an access to a page not currently in memory
-
● is a reference to a page belonging to another program
-
● occurs when a program accesses a page of memory
Pregunta 47
Pregunta
197. Which of the following statements is false?
Respuesta
-
● internal fragmentation is increased with small pages
-
● a small page size causes large page tables
-
● a large page size causes instructions and data that will not be referenced brought into primary storage
-
● I\O transfers are more efficient with large pages
Pregunta 48
Pregunta
198. Swapping:
Respuesta
-
● none of the above
-
● does not work with overlaying
-
● allows each program in turn to use the memory
-
● allows many programs to use memory simultaneously
Pregunta 49
Pregunta
199. Which of the following is not true about the memory management?
Respuesta
-
● None of the above
-
● segmented memory can be paged
-
● paging suffers from internal fragmentation
-
● segmentation suffers from external fragmentation
-
● virtual memory is used only in multi-user systems
Pregunta 50
Pregunta
200. True or false: segmentation suffers from external fragmentation?
Respuesta
-
False
-
True
Pregunta 51
Pregunta
201. True or false: paging suffers from external fragmentation?
Respuesta
-
True
-
False
Pregunta 52
Pregunta
202. What is a method of memory allocation by which the program is
subdivided into equal portions, or pages and core is subdivided into equal
portions or blocks?
Respuesta
-
● partition
-
● paging
-
● segmentation
-
● virtual memory
Pregunta 53
Pregunta
203. In memory systems, boundary registers?
Respuesta
-
● are used for temporary program variable storage
-
● are only necessary with fixed partitions
-
● track page boundaries
-
● track the beginning and ending of programs
Pregunta 54
Pregunta
204. A relationship between processes such that each has some part (четыре вопроса в одном)critical
section) which must not be executed while the critical section of another is
being executed, is known as?
Respuesta
-
● multiprogramming
-
● Mutual exclusion
-
● Semaphore
-
● Multitasking
Pregunta 55
Pregunta
205. CPU fetches the instruction from memory according to the value of?
Respuesta
-
● program status word
-
● instruction register
-
● program counter
-
● status register
Pregunta 56
Pregunta
206. A memory used to provide a high speed is called?
Respuesta
-
● stack pointer
-
● disk buffer
-
● main memory
-
● cache
Pregunta 57
Pregunta
207. Which one of the following is the address generated by CPU?
Respuesta
-
● none of the above
-
● absolute address
-
● physical address
-
● logical address
Pregunta 58
Pregunta
208. Runtime mapping from virtual to physical address is done by?
Respuesta
-
● PCI
-
● memory management unit
-
● none of the above
-
● CPU
Pregunta 59
Pregunta
209. The address of a page table in memory is pointed by:
Respuesta
-
● program counter
-
● page register
-
● stack pointer
-
● page table base register
Pregunta 60
Pregunta
210. Program always deals with:
Respuesta
-
● absolute address
-
● relative address
-
● physical address
-
● logical address
Pregunta 61
Pregunta
211. What is compaction?
Respuesta
-
● a technique for overcoming external fragmentation
-
● a technique for overcoming internal fragmentation
-
● a technique for overcoming fatal error
-
● a paging technique
Pregunta 62
Pregunta
212. Operating System maintains the page table for:
Respuesta
-
● each address
-
● each instruction
-
● each thread
-
● each process
Pregunta 63
Pregunta
213. In contiguous memory allocation:
Respuesta
-
● all processes is contained in a single contiguous section of memory
-
● the memory space is contiguous
-
● none of the above
-
● each process is contained in a single contiguous section of memory
Pregunta 64
Pregunta
214. When memory is divided into several fixed sized partitions, each
partition may contain ________.
Respuesta
-
● multiple processes at once
-
● at least one process
-
● none of the above
-
● exactly one process
Pregunta 65
Pregunta
215. In fixed sized partition, the degree of multiprogramming is bounded by
___________.
Respuesta
-
● the CPU utilization
-
● the number of partitions
-
● all of the above
-
● the memory size
Pregunta 66
Pregunta
216. The first fit, best fit and worst fit are strategies to select a ______.
Respuesta
-
● processor to run the next process
-
● free hole from a set of available holes
-
● all of the above
-
● process from a queue to put in memory
Pregunta 67
Pregunta
217. In internal fragmentation, memory is internal to a partition and:
Respuesta
-
● is being used
-
● is always used
-
● none of the above
-
● is not being used
Pregunta 68
Pregunta
218. A solution to the problem of external fragmentation is:
Respuesta
-
● smaller memory space
-
● unequal size parts
-
● larger memory size
-
● compaction
Pregunta 69
Pregunta
219. __________ is generally faster than _________ .
Respuesta
-
● none of the above
-
● first fit, best fit
-
● best fit, first fit
-
● worst fit, best fit
Pregunta 70
Pregunta
220. External fragmentation exists when:
Respuesta
-
● a request cannot be satisfied even when the total memory is free
-
● enough total memory exists to satisfy a request but it is not contiguous
-
● the total memory is insufficient to satisfy a request
-
● none of the above
Pregunta 71
Pregunta
221. External fragmentation will not occur when:
Respuesta
-
● next fit is used
-
● best fit is used
-
● first fit is used
-
● no matter which algorithm is used, it will always occur
Pregunta 72
Pregunta
222. When the memory allocated to a process is slightly larger than the
process, then:
Respuesta
-
● none of the above
-
● internal fragmentation occurs
-
● external fragmentation occurs
-
● both will occur
Pregunta 73
Pregunta
223. Main memory is broken into fixed-sized blocks called ________.:
Respuesta
-
● segments
-
● frames
-
● pages
-
● none of the above
Pregunta 74
Pregunta
224. Fixed-length block of data in secondary memory is called ________.:
Respuesta
-
● pages
-
segments
-
● frames
-
● none of the above
Pregunta 75
Pregunta
225. Variable-length block of data that resides in secondary memory is called
________.
Respuesta
-
● pages
-
● segments
-
● frames
-
● none of the above
Pregunta 76
Pregunta
226. Every address generated by the CPU is divided into two parts:
Respuesta
-
● page offset
-
● frame bit
-
● page number
-
● frame offset
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.