Kopieren und bearbeiten

www.OS.com IV

Beschreibung

Quiz am www.OS.com IV, erstellt von hoffa HOFFMAN am 19/12/2019.
hoffa HOFFMAN
Quiz von hoffa HOFFMAN, aktualisiert more than 1 year ago
hoffa HOFFMAN
Erstellt von hoffa HOFFMAN vor mehr als 5 Jahre
203
0
0
1 2 3 4 5 (0)

Zusammenfassung der Ressource

Frage 1

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

Frage 2

Frage
152. Mutual exclusion means that?
Antworten
  • ● 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

Frage 3

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

Frage 4

Frage
154. An un-interruptible unit is known as:
Antworten
  • ● atomic
  • ● static
  • ● none of the above
  • ● single

Frage 5

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

Frage 6

Frage
156. The two atomic operations permissible on semaphores are:
Antworten
  • ● stop
  • ● hold
  • ● signal
  • ● wait

Frage 7

Frage
157. The code that changes the value of the semaphore is:
Antworten
  • ● critical section code
  • ● none of the above
  • ● remainder section code
  • ● non-critical section code

Frage 8

Frage
158. The two kinds of semaphores are:
Antworten
  • ● decimal
  • ● binary, counting
  • ● mutex

Frage 9

Frage
159. A binary semaphore is a semaphore with integer values :
Antworten
  • ● 0.5
  • ● 0
  • ● -1
  • ● 1

Frage 10

Frage
160. A monitor is a type of:
Antworten
  • ● semaphore
  • ● low level synchronization construct
  • ● high level synchronization construct
  • ● none of the above

Frage 11

Frage
161. What is the reusable resource:
Antworten
  • ● 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

Frage 12

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

Frage 13

Frage
163. A system is in the safe state if:
Antworten
  • ● 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

Frage 14

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

Frage 15

Frage
165. A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
Antworten
  • ● inversion
  • ● aging
  • ● deadlock
  • ● starvation

Frage 16

Frage
166. The number of resources requested by a process:
Antworten
  • ● 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

Frage 17

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

Frage 18

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

Frage 19

Frage
169. A state is safe, if:
Antworten
  • ● 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

Frage 20

Frage
170. The available vector defines
Antworten
  • ● 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

Frage 21

Frage
171. The resource vector define
Antworten
  • ● 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

Frage 22

Frage
172. This matrix defines the current allocation to process i of the resource j
Antworten
  • ● Claim matrix
  • ● Request matrix
  • ● Resource matrix
  • ● Allocation matrix

Frage 23

Frage
173. This matrix defines the amount of resources of type j requested by process i
Antworten
  • ● Claim matrix
  • ● Request matrix
  • ● Resource matrix
  • ● Allocation matrix

Frage 24

Frage
174. This matrix defines requirements of processes i for the resources j
Antworten
  • ● Claim matrix
  • ● Request matrix
  • ● Resource matrix
  • ● Allocation matrix

Frage 25

Frage
175. The banker's algorithm is referred to as
Antworten
  • ● resource allocation refusal
  • ● loan allocation denial
  • ● resource allocation denial
  • ● denial of service

Frage 26

Frage
176. 'Hold and wait' condition for deadlock is defined as
Antworten
  • ● 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

Frage 27

Frage
177. 'Circular wait' condition for deadlock is defined as
Antworten
  • ● 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

Frage 28

Frage
178. 'No preemption' condition for deadlock is defined as
Antworten
  • ● 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

Frage 29

Frage
179. 'Mutual exclusion' condition for deadlock is defined as
Antworten
  • ● 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

Frage 30

Frage
180. What is NOT an example of consumable resource?
Antworten
  • ● Messages
  • ● Main memory
  • ● Signals
  • ● Information in I\O buffers

Frage 31

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

Frage 32

Frage
182. This resource can be created and destroyed
Antworten
  • ● finite resource
  • ● consumable resource
  • ● restartable resource
  • ● resumable resource

Frage 33

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

Frage 34

Frage
184. Deadlock inevitable region can be referred to as a
Antworten
  • ● false region
  • ● final region
  • ● fatal region
  • ● fun region

Frage 35

Frage
185. This illustrates the progress of two processes competing for two resources
Antworten
  • ● joint progress diagram
  • ● joint regress diagram
  • ● joint ingres diagram
  • ● joint process diagram

Frage 36

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

Frage 37

Frage
187. Which of the following statements is false:
Antworten
  • ● 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

Frage 38

Frage
188. Memory is:
Antworten
  • ● 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

Frage 39

Frage
189. Processor is:
Antworten
  • ● 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

Frage 40

Frage
190. Program is:
Antworten
  • ● 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

Frage 41

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

Frage 42

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

Frage 43

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

Frage 44

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

Frage 45

Frage
195. How to solve problem of "external" fragmentation?
Antworten
  • ● none of these
  • ● smaller memory space
  • ● larger memory space
  • ● compaction

Frage 46

Frage
196. A page fault?
Antworten
  • ● 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

Frage 47

Frage
197. Which of the following statements is false?
Antworten
  • ● 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

Frage 48

Frage
198. Swapping:
Antworten
  • ● 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

Frage 49

Frage
199. Which of the following is not true about the memory management?
Antworten
  • ● 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

Frage 50

Frage
200. True or false: segmentation suffers from external fragmentation?
Antworten
  • False
  • True

Frage 51

Frage
201. True or false: paging suffers from external fragmentation?
Antworten
  • True
  • False

Frage 52

Frage
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?
Antworten
  • ● partition
  • ● paging
  • ● segmentation
  • ● virtual memory

Frage 53

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

Frage 54

Frage
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?
Antworten
  • ● multiprogramming
  • ● Mutual exclusion
  • ● Semaphore
  • ● Multitasking

Frage 55

Frage
205. CPU fetches the instruction from memory according to the value of?
Antworten
  • ● program status word
  • ● instruction register
  • ● program counter
  • ● status register

Frage 56

Frage
206. A memory used to provide a high speed is called?
Antworten
  • ● stack pointer
  • ● disk buffer
  • ● main memory
  • ● cache

Frage 57

Frage
207. Which one of the following is the address generated by CPU?
Antworten
  • ● none of the above
  • ● absolute address
  • ● physical address
  • ● logical address

Frage 58

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

Frage 59

Frage
209. The address of a page table in memory is pointed by:
Antworten
  • ● program counter
  • ● page register
  • ● stack pointer
  • ● page table base register

Frage 60

Frage
210. Program always deals with:
Antworten
  • ● absolute address
  • ● relative address
  • ● physical address
  • ● logical address

Frage 61

Frage
211. What is compaction?
Antworten
  • ● a technique for overcoming external fragmentation
  • ● a technique for overcoming internal fragmentation
  • ● a technique for overcoming fatal error
  • ● a paging technique

Frage 62

Frage
212. Operating System maintains the page table for:
Antworten
  • ● each address
  • ● each instruction
  • ● each thread
  • ● each process

Frage 63

Frage
213. In contiguous memory allocation:
Antworten
  • ● 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

Frage 64

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

Frage 65

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

Frage 66

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

Frage 67

Frage
217. In internal fragmentation, memory is internal to a partition and:
Antworten
  • ● is being used
  • ● is always used
  • ● none of the above
  • ● is not being used

Frage 68

Frage
218. A solution to the problem of external fragmentation is:
Antworten
  • ● smaller memory space
  • ● unequal size parts
  • ● larger memory size
  • ● compaction

Frage 69

Frage
219. __________ is generally faster than _________ .
Antworten
  • ● none of the above
  • ● first fit, best fit
  • ● best fit, first fit
  • ● worst fit, best fit

Frage 70

Frage
220. External fragmentation exists when:
Antworten
  • ● 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

Frage 71

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

Frage 72

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

Frage 73

Frage
223. Main memory is broken into fixed-sized blocks called ________.:
Antworten
  • ● segments
  • ● frames
  • ● pages
  • ● none of the above

Frage 74

Frage
224. Fixed-length block of data in secondary memory is called ________.:
Antworten
  • ● pages
  • segments
  • ● frames
  • ● none of the above

Frage 75

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

Frage 76

Frage
226. Every address generated by the CPU is divided into two parts:
Antworten
  • ● page offset
  • ● frame bit
  • ● page number
  • ● frame offset
Zusammenfassung anzeigen Zusammenfassung ausblenden

0 Kommentare

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

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

PuKW STEP 6 (mögliche Prüfungsfragen/Prüfungsvorbereitung)
frau planlos
Wege, um mit GoConqr Tools zu unterrichten
Elena Koch
La mondialisation - Vocab
Gaelle Bourgeois
Euro-FH // Zusammenfassung SOPS1
Robert Paul
Mathematische Psychologie IV - MVB-Modell des Quellengedächtnisses
Johanna Brinkmann
Wichtige Fälle/ Patienten aus der Allgemeinen Psychologie (ALPS)
Caroline X
Vetie Pharma2016 neu
marie nehring
Vetie Radiologie 2017
Péroline de Gail
Innere Schwein Vetie
Anne Käfer
Chirurgie Pferd Vetie
Anne Käfer
Bibliothek durchsuchen