Copiar e Editar

www.OS.com IV

Descrição

Quiz sobre www.OS.com IV, criado por hoffa HOFFMAN em 19-12-2019.
hoffa HOFFMAN
Quiz por hoffa HOFFMAN, atualizado more than 1 year ago
hoffa HOFFMAN
Criado por hoffa HOFFMAN mais de 5 anos atrás
204
0
0
1 2 3 4 5 (0)

Resumo de Recurso

Questão 1

Questão
151. The segment of code in which the process may change common variables, update tables, write into files is known as?
Responda
  • ● critical section
  • ● mutual exclusion
  • ● non-critical section
  • ● program

Questão 2

Questão
152. Mutual exclusion means that?
Responda
  • ● 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

Questão 3

Questão
153. A minimum of _____ variable(четыре вопроса в одном)s) is/are required to be shared between processes to solve the critical section problem?
Responda
  • ● four
  • ● one
  • ● three
  • ● two

Questão 4

Questão
154. An un-interruptible unit is known as:
Responda
  • ● atomic
  • ● static
  • ● none of the above
  • ● single

Questão 5

Questão
155. Semaphore is a/an _______ to solve the critical section problem?
Responda
  • ● hardware for a system
  • ● integer variable
  • ● complex structure
  • ● special program for a system

Questão 6

Questão
156. The two atomic operations permissible on semaphores are:
Responda
  • ● stop
  • ● hold
  • ● signal
  • ● wait

Questão 7

Questão
157. The code that changes the value of the semaphore is:
Responda
  • ● critical section code
  • ● none of the above
  • ● remainder section code
  • ● non-critical section code

Questão 8

Questão
158. The two kinds of semaphores are:
Responda
  • ● decimal
  • ● binary, counting
  • ● mutex

Questão 9

Questão
159. A binary semaphore is a semaphore with integer values :
Responda
  • ● 0.5
  • ● 0
  • ● -1
  • ● 1

Questão 10

Questão
160. A monitor is a type of:
Responda
  • ● semaphore
  • ● low level synchronization construct
  • ● high level synchronization construct
  • ● none of the above

Questão 11

Questão
161. What is the reusable resource:
Responda
  • ● 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

Questão 12

Questão
162. Which of the following condition is required for deadlock to be possible?
Responda
  • ● 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

Questão 13

Questão
163. A system is in the safe state if:
Responda
  • ● 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

Questão 14

Questão
164. Which one of the following is the deadlock avoidance algorithm?
Responda
  • ● round-robin algorithm
  • ● banker’s algorithm
  • ● elevator algorithm
  • ● dining philosophers problem

Questão 15

Questão
165. A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
Responda
  • ● inversion
  • ● aging
  • ● deadlock
  • ● starvation

Questão 16

Questão
166. The number of resources requested by a process:
Responda
  • ● 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

Questão 17

Questão
167. For non-sharable resources like a printer, mutual exclusion:
Responda
  • ● may exist
  • ● must not exist
  • ● none of the above
  • ● must exist

Questão 18

Questão
168. A deadlock avoidance algorithm dynamically examines the __________, to ensure that a circular wait condition can never exist.
Responda
  • ● system storage state
  • ● resource allocation state
  • ● operating system
  • ● resources

Questão 19

Questão
169. A state is safe, if:
Responda
  • ● 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

Questão 20

Questão
170. The available vector defines
Responda
  • ● 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

Questão 21

Questão
171. The resource vector define
Responda
  • ● 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

Questão 22

Questão
172. This matrix defines the current allocation to process i of the resource j
Responda
  • ● Claim matrix
  • ● Request matrix
  • ● Resource matrix
  • ● Allocation matrix

Questão 23

Questão
173. This matrix defines the amount of resources of type j requested by process i
Responda
  • ● Claim matrix
  • ● Request matrix
  • ● Resource matrix
  • ● Allocation matrix

Questão 24

Questão
174. This matrix defines requirements of processes i for the resources j
Responda
  • ● Claim matrix
  • ● Request matrix
  • ● Resource matrix
  • ● Allocation matrix

Questão 25

Questão
175. The banker's algorithm is referred to as
Responda
  • ● resource allocation refusal
  • ● loan allocation denial
  • ● resource allocation denial
  • ● denial of service

Questão 26

Questão
176. 'Hold and wait' condition for deadlock is defined as
Responda
  • ● 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

Questão 27

Questão
177. 'Circular wait' condition for deadlock is defined as
Responda
  • ● 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

Questão 28

Questão
178. 'No preemption' condition for deadlock is defined as
Responda
  • ● 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

Questão 29

Questão
179. 'Mutual exclusion' condition for deadlock is defined as
Responda
  • ● 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

Questão 30

Questão
180. What is NOT an example of consumable resource?
Responda
  • ● Messages
  • ● Main memory
  • ● Signals
  • ● Information in I\O buffers

Questão 31

Questão
181. What is NOT an example of reusable resource?
Responda
  • ● i/o channels
  • ● interrupt
  • ● processors
  • ● semaphores

Questão 32

Questão
182. This resource can be created and destroyed
Responda
  • ● finite resource
  • ● consumable resource
  • ● restartable resource
  • ● resumable resource

Questão 33

Questão
183. This resource can be safely used by only one process at a time and is not depleted by that use
Responda
  • ● refreshing resource
  • ● reusable resource
  • ● replenishing resource
  • ● refurbished resource

Questão 34

Questão
184. Deadlock inevitable region can be referred to as a
Responda
  • ● false region
  • ● final region
  • ● fatal region
  • ● fun region

Questão 35

Questão
185. This illustrates the progress of two processes competing for two resources
Responda
  • ● joint progress diagram
  • ● joint regress diagram
  • ● joint ingres diagram
  • ● joint process diagram

Questão 36

Questão
186. When each process in the set is blocked awaiting for resource siezed by another blocked process
Responda
  • ● it is a mortallock
  • ● it is a softlock
  • ● it is a deadlock
  • ● it is a deadend

Questão 37

Questão
187. Which of the following statements is false:
Responda
  • ● 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

Questão 38

Questão
188. Memory is:
Responda
  • ● 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

Questão 39

Questão
189. Processor is:
Responda
  • ● 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

Questão 40

Questão
190. Program is:
Responda
  • ● 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

Questão 41

Questão
191. The memory allocation scheme subject to "external" fragmentation is?
Responda
  • ● pure demand paging
  • ● multiple contiguous fixed partitionings
  • ● swapping
  • ● segmentation

Questão 42

Questão
192. The memory allocation scheme subject to "internal" fragmentation is?
Responda
  • ● pure demand paging
  • ● multiple contiguous fixed partitionings
  • ● swapping
  • ● segmentation

Questão 43

Questão
193. Any program, no matter how small, will occupy an entire partition results in?
Responda
  • ● external fragmentation
  • ● paging
  • ● segmentation
  • ● internal fragmentation

Questão 44

Questão
194. How to solve problem of equal-size partitions? swapping (?) ----- page 318 book
Responda
  • ● virtual memory segmentation
  • ● compaction
  • ● segmentation
  • ● unequal-size partitions

Questão 45

Questão
195. How to solve problem of "external" fragmentation?
Responda
  • ● none of these
  • ● smaller memory space
  • ● larger memory space
  • ● compaction

Questão 46

Questão
196. A page fault?
Responda
  • ● 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

Questão 47

Questão
197. Which of the following statements is false?
Responda
  • ● 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

Questão 48

Questão
198. Swapping:
Responda
  • ● 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

Questão 49

Questão
199. Which of the following is not true about the memory management?
Responda
  • ● 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

Questão 50

Questão
200. True or false: segmentation suffers from external fragmentation?
Responda
  • False
  • True

Questão 51

Questão
201. True or false: paging suffers from external fragmentation?
Responda
  • True
  • False

Questão 52

Questão
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?
Responda
  • ● partition
  • ● paging
  • ● segmentation
  • ● virtual memory

Questão 53

Questão
203. In memory systems, boundary registers?
Responda
  • ● are used for temporary program variable storage
  • ● are only necessary with fixed partitions
  • ● track page boundaries
  • ● track the beginning and ending of programs

Questão 54

Questão
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?
Responda
  • ● multiprogramming
  • ● Mutual exclusion
  • ● Semaphore
  • ● Multitasking

Questão 55

Questão
205. CPU fetches the instruction from memory according to the value of?
Responda
  • ● program status word
  • ● instruction register
  • ● program counter
  • ● status register

Questão 56

Questão
206. A memory used to provide a high speed is called?
Responda
  • ● stack pointer
  • ● disk buffer
  • ● main memory
  • ● cache

Questão 57

Questão
207. Which one of the following is the address generated by CPU?
Responda
  • ● none of the above
  • ● absolute address
  • ● physical address
  • ● logical address

Questão 58

Questão
208. Runtime mapping from virtual to physical address is done by?
Responda
  • ● PCI
  • ● memory management unit
  • ● none of the above
  • ● CPU

Questão 59

Questão
209. The address of a page table in memory is pointed by:
Responda
  • ● program counter
  • ● page register
  • ● stack pointer
  • ● page table base register

Questão 60

Questão
210. Program always deals with:
Responda
  • ● absolute address
  • ● relative address
  • ● physical address
  • ● logical address

Questão 61

Questão
211. What is compaction?
Responda
  • ● a technique for overcoming external fragmentation
  • ● a technique for overcoming internal fragmentation
  • ● a technique for overcoming fatal error
  • ● a paging technique

Questão 62

Questão
212. Operating System maintains the page table for:
Responda
  • ● each address
  • ● each instruction
  • ● each thread
  • ● each process

Questão 63

Questão
213. In contiguous memory allocation:
Responda
  • ● 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

Questão 64

Questão
214. When memory is divided into several fixed sized partitions, each partition may contain ________.
Responda
  • ● multiple processes at once
  • ● at least one process
  • ● none of the above
  • ● exactly one process

Questão 65

Questão
215. In fixed sized partition, the degree of multiprogramming is bounded by ___________.
Responda
  • ● the CPU utilization
  • ● the number of partitions
  • ● all of the above
  • ● the memory size

Questão 66

Questão
216. The first fit, best fit and worst fit are strategies to select a ______.
Responda
  • ● 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

Questão 67

Questão
217. In internal fragmentation, memory is internal to a partition and:
Responda
  • ● is being used
  • ● is always used
  • ● none of the above
  • ● is not being used

Questão 68

Questão
218. A solution to the problem of external fragmentation is:
Responda
  • ● smaller memory space
  • ● unequal size parts
  • ● larger memory size
  • ● compaction

Questão 69

Questão
219. __________ is generally faster than _________ .
Responda
  • ● none of the above
  • ● first fit, best fit
  • ● best fit, first fit
  • ● worst fit, best fit

Questão 70

Questão
220. External fragmentation exists when:
Responda
  • ● 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

Questão 71

Questão
221. External fragmentation will not occur when:
Responda
  • ● next fit is used
  • ● best fit is used
  • ● first fit is used
  • ● no matter which algorithm is used, it will always occur

Questão 72

Questão
222. When the memory allocated to a process is slightly larger than the process, then:
Responda
  • ● none of the above
  • ● internal fragmentation occurs
  • ● external fragmentation occurs
  • ● both will occur

Questão 73

Questão
223. Main memory is broken into fixed-sized blocks called ________.:
Responda
  • ● segments
  • ● frames
  • ● pages
  • ● none of the above

Questão 74

Questão
224. Fixed-length block of data in secondary memory is called ________.:
Responda
  • ● pages
  • segments
  • ● frames
  • ● none of the above

Questão 75

Questão
225. Variable-length block of data that resides in secondary memory is called ________.
Responda
  • ● pages
  • ● segments
  • ● frames
  • ● none of the above

Questão 76

Questão
226. Every address generated by the CPU is divided into two parts:
Responda
  • ● page offset
  • ● frame bit
  • ● page number
  • ● frame offset

0 comentários

There are no comments, be the first and leave one below:

Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.

Semelhante

Cinemática Escalar: Conceitos fundamentais
Bruno Fernandes3682
Etica da Advocacia
kellisim
Como Estudar Química
Alessandra S.
Principais temas para estudar Português
Marina Faria
Substantivo (em construção)
Ray Macunayma
Revisão de Direito Penal
Alice Sousa
Carboidrato
Andrea Barreto M. Da Poça
RESUMO DE LITERATURA (PARTE 1)
Ana Loss
Certo e Errado - Língua Portuguesa
Sérgio Britto
PODERES ADMINIS- TRATIVOS
Mateus de Souza
Explore a Biblioteca