Copy and Edit

www.OS.com IV

Description

Quiz on www.OS.com IV, created by hoffa HOFFMAN on 19/12/2019.
hoffa HOFFMAN
Quiz by hoffa HOFFMAN, updated more than 1 year ago
hoffa HOFFMAN
Created by hoffa HOFFMAN over 5 years ago
202
0
0
1 2 3 4 5 (0)

Resource summary

Question 1

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

Question 2

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

Question 3

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

Question 4

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

Question 5

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

Question 6

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

Question 7

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

Question 8

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

Question 9

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

Question 10

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

Question 11

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

Question 12

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

Question 13

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

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

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

Question 22

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

Question 23

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

Question 24

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

Question 25

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

Question 26

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

Question 27

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

Question 28

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

Question 29

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

Question 30

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

Question 31

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

Question 32

Question
182. This resource can be created and destroyed
Answer
  • ● finite resource
  • ● consumable resource
  • ● restartable resource
  • ● resumable resource

Question 33

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

Question 34

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

Question 35

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

Question 36

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

Question 37

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

Question 38

Question
188. Memory is:
Answer
  • ● 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

Question 39

Question
189. Processor is:
Answer
  • ● 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

Question 40

Question
190. Program is:
Answer
  • ● 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

Question 41

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

Question 42

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

Question 43

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

Question 44

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

Question 45

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

Question 46

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

Question 47

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

Question 48

Question
198. Swapping:
Answer
  • ● 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

Question 49

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

Question 50

Question
200. True or false: segmentation suffers from external fragmentation?
Answer
  • False
  • True

Question 51

Question
201. True or false: paging suffers from external fragmentation?
Answer
  • True
  • False

Question 52

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

Question 53

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

Question 54

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

Question 55

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

Question 56

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

Question 57

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

Question 58

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

Question 59

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

Question 60

Question
210. Program always deals with:
Answer
  • ● absolute address
  • ● relative address
  • ● physical address
  • ● logical address

Question 61

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

Question 62

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

Question 63

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

Question 64

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

Question 65

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

Question 66

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

Question 67

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

Question 68

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

Question 69

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

Question 70

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

Question 71

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

Question 72

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

Question 73

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

Question 74

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

Question 75

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

Question 76

Question
226. Every address generated by the CPU is divided into two parts:
Answer
  • ● page offset
  • ● frame bit
  • ● page number
  • ● frame offset
Show full summary Hide full summary

0 comments

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

Want to create your own Quizzes for free with GoConqr? Learn more.

Similar

Epithelial tissue
Morgan Morgan
ACT Quiz
Brad Hegarty
Cognitive Psychology Key Terms
Veleka Georgieva
Y11 SACE Biology Ecology Flash Cards
Ben Goetze
Biology- Genes, Chromosomes and DNA
Laura Perry
Spanish connectives and a few key phrases
emdrakeley
Maths GCSE - What to revise!
sallen
GCSE Biology B1 (OCR)
Usman Rauf
Edexcel Additional Science Biology Topic 1- Genes and Enzymes
hchen8nrd
PSBD TEST # 3
yog thapa
Browse Library