hoffa HOFFMAN
Quiz by , created more than 1 year ago

Quiz on www.OS.com IV, created by hoffa HOFFMAN on 19/12/2019.

205
0
0
No tags specified
hoffa HOFFMAN
Created by hoffa HOFFMAN almost 7 years ago
Close

www.OS.com IV

Question 1 of 76

1

151. The segment of code in which the process may change common
variables, update tables, write into files is known as?

Select one of the following:

  • ● critical section

  • ● mutual exclusion

  • ● non-critical section

  • ● program

Explanation

Question 2 of 76

1

152. Mutual exclusion means that?

Select one of the following:

  • ● 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

Explanation

Question 3 of 76

1

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

Select one of the following:

  • ● four

  • ● one

  • ● three

  • ● two

Explanation

Question 4 of 76

1

154. An un-interruptible unit is known as:

Select one of the following:

  • ● atomic

  • ● static

  • ● none of the above

  • ● single

Explanation

Question 5 of 76

1

155. Semaphore is a/an _______ to solve the critical section problem?

Select one of the following:

  • ● hardware for a system

  • ● integer variable

  • ● complex structure

  • ● special program for a system

Explanation

Question 6 of 76

1

156. The two atomic operations permissible on semaphores are:

Select one or more of the following:

  • ● stop

  • ● hold

  • ● signal

  • ● wait

Explanation

Question 7 of 76

1

157. The code that changes the value of the semaphore is:

Select one of the following:

  • ● critical section code

  • ● none of the above

  • ● remainder section code

  • ● non-critical section code

Explanation

Question 8 of 76

1

158. The two kinds of semaphores are:

Select one of the following:

  • ● decimal

  • ● binary, counting

  • ● mutex

Explanation

Question 9 of 76

1

159. A binary semaphore is a semaphore with integer values :

Select one or more of the following:

  • ● 0.5

  • ● 0

  • ● -1

  • ● 1

Explanation

Question 10 of 76

1

160. A monitor is a type of:

Select one of the following:

  • ● semaphore

  • ● low level synchronization construct

  • ● high level synchronization construct

  • ● none of the above

Explanation

Question 11 of 76

1

161. What is the reusable resource:

Select one of the following:

  • ● 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

Explanation

Question 12 of 76

1

162. Which of the following condition is required for deadlock to be
possible?

Select one of the following:

  • ● 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

Explanation

Question 13 of 76

1

163. A system is in the safe state if:

Select one of the following:

  • ● 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

Explanation

Question 14 of 76

1

164. Which one of the following is the deadlock avoidance algorithm?

Select one of the following:

  • ● round-robin algorithm

  • ● banker’s algorithm

  • ● elevator algorithm

  • ● dining philosophers problem

Explanation

Question 15 of 76

1

165. A problem encountered in multitasking when a process is perpetually
denied necessary resources is called:

Select one of the following:

  • ● inversion

  • ● aging

  • ● deadlock

  • ● starvation

Explanation

Question 16 of 76

1

166. The number of resources requested by a process:

Select one of the following:

  • ● 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

Explanation

Question 17 of 76

1

167. For non-sharable resources like a printer, mutual exclusion:

Select one of the following:

  • ● may exist

  • ● must not exist

  • ● none of the above

  • ● must exist

Explanation

Question 18 of 76

1

168. A deadlock avoidance algorithm dynamically examines the __________,
to ensure that a circular wait condition can never exist.

Select one of the following:

  • ● system storage state

  • ● resource allocation state

  • ● operating system

  • ● resources

Explanation

Question 19 of 76

1

169. A state is safe, if:

Select one of the following:

  • ● 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

Explanation

Question 20 of 76

1

170. The available vector defines

Select one of the following:

  • ● 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

Explanation

Question 21 of 76

1

171. The resource vector define

Select one of the following:

  • ● 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

Explanation

Question 22 of 76

1

172. This matrix defines the current allocation to process i of the resource j

Select one of the following:

  • ● Claim matrix

  • ● Request matrix

  • ● Resource matrix

  • ● Allocation matrix

Explanation

Question 23 of 76

1

173. This matrix defines the amount of resources of type j requested by
process i

Select one of the following:

  • ● Claim matrix

  • ● Request matrix

  • ● Resource matrix

  • ● Allocation matrix

Explanation

Question 24 of 76

1

174. This matrix defines requirements of processes i for the resources j

Select one of the following:

  • ● Claim matrix

  • ● Request matrix

  • ● Resource matrix

  • ● Allocation matrix

Explanation

Question 25 of 76

1

175. The banker's algorithm is referred to as

Select one of the following:

  • ● resource allocation refusal

  • ● loan allocation denial

  • ● resource allocation denial

  • ● denial of service

Explanation

Question 26 of 76

1

176. 'Hold and wait' condition for deadlock is defined as

Select one of the following:

  • ● 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

Explanation

Question 27 of 76

1

177. 'Circular wait' condition for deadlock is defined as

Select one of the following:

  • ● 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

Explanation

Question 28 of 76

1

178. 'No preemption' condition for deadlock is defined as

Select one of the following:

  • ● 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

Explanation

Question 29 of 76

1

179. 'Mutual exclusion' condition for deadlock is defined as

Select one of the following:

  • ● 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

Explanation

Question 30 of 76

1

180. What is NOT an example of consumable resource?

Select one of the following:

  • ● Messages

  • ● Main memory

  • ● Signals

  • ● Information in I\O buffers

Explanation

Question 31 of 76

1

181. What is NOT an example of reusable resource?

Select one of the following:

  • ● i/o channels

  • ● interrupt

  • ● processors

  • ● semaphores

Explanation

Question 32 of 76

1

182. This resource can be created and destroyed

Select one of the following:

  • ● finite resource

  • ● consumable resource

  • ● restartable resource

  • ● resumable resource

Explanation

Question 33 of 76

1

183. This resource can be safely used by only one process at a time and is
not depleted by that use

Select one of the following:

  • ● refreshing resource

  • ● reusable resource

  • ● replenishing resource

  • ● refurbished resource

Explanation

Question 34 of 76

1

184. Deadlock inevitable region can be referred to as a

Select one of the following:

  • ● false region

  • ● final region

  • ● fatal region

  • ● fun region

Explanation

Question 35 of 76

1

185. This illustrates the progress of two processes competing for two
resources

Select one of the following:

  • ● joint progress diagram

  • ● joint regress diagram

  • ● joint ingres diagram

  • ● joint process diagram

Explanation

Question 36 of 76

1

186. When each process in the set is blocked awaiting for resource siezed by
another blocked process

Select one of the following:

  • ● it is a mortallock

  • ● it is a softlock

  • ● it is a deadlock

  • ● it is a deadend

Explanation

Question 37 of 76

1

187. Which of the following statements is false:

Select one or more of the following:

  • ● 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

Explanation

Question 38 of 76

1

188. Memory is:

Select one of the following:

  • ● 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

Explanation

Question 39 of 76

1

189. Processor is:

Select one of the following:

  • ● 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

Explanation

Question 40 of 76

1

190. Program is:

Select one of the following:

  • ● 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

Explanation

Question 41 of 76

1

191. The memory allocation scheme subject to "external" fragmentation is?

Select one of the following:

  • ● pure demand paging

  • ● multiple contiguous fixed partitionings

  • ● swapping

  • ● segmentation

Explanation

Question 42 of 76

1

192. The memory allocation scheme subject to "internal" fragmentation is?

Select one of the following:

  • ● pure demand paging

  • ● multiple contiguous fixed partitionings

  • ● swapping

  • ● segmentation

Explanation

Question 43 of 76

1

193. Any program, no matter how small, will occupy an entire partition
results in?

Select one of the following:

  • ● external fragmentation

  • ● paging

  • ● segmentation

  • ● internal fragmentation

Explanation

Question 44 of 76

1

194. How to solve problem of equal-size partitions?
swapping (?) ----- page 318 book

Select one of the following:

  • ● virtual memory segmentation

  • ● compaction

  • ● segmentation

  • ● unequal-size partitions

Explanation

Question 45 of 76

1

195. How to solve problem of "external" fragmentation?

Select one of the following:

  • ● none of these

  • ● smaller memory space

  • ● larger memory space

  • ● compaction

Explanation

Question 46 of 76

1

196. A page fault?

Select one of the following:

  • ● 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

Explanation

Question 47 of 76

1

197. Which of the following statements is false?

Select one of the following:

  • ● 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

Explanation

Question 48 of 76

1

198. Swapping:

Select one of the following:

  • ● 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

Explanation

Question 49 of 76

1

199. Which of the following is not true about the memory management?

Select one of the following:

  • ● 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

Explanation

Question 50 of 76

1

200. True or false: segmentation suffers from external fragmentation?

Select one of the following:

  • False

  • True

Explanation

Question 51 of 76

1

201. True or false: paging suffers from external fragmentation?

Select one of the following:

  • True

  • False

Explanation

Question 52 of 76

1

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?

Select one of the following:

  • ● partition

  • ● paging

  • ● segmentation

  • ● virtual memory

Explanation

Question 53 of 76

1

203. In memory systems, boundary registers?

Select one of the following:

  • ● are used for temporary program variable storage

  • ● are only necessary with fixed partitions

  • ● track page boundaries

  • ● track the beginning and ending of programs

Explanation

Question 54 of 76

1

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?

Select one of the following:

  • ● multiprogramming

  • ● Mutual exclusion

  • ● Semaphore

  • ● Multitasking

Explanation

Question 55 of 76

1

205. CPU fetches the instruction from memory according to the value of?

Select one of the following:

  • ● program status word

  • ● instruction register

  • ● program counter

  • ● status register

Explanation

Question 56 of 76

1

206. A memory used to provide a high speed is called?

Select one of the following:

  • ● stack pointer

  • ● disk buffer

  • ● main memory

  • ● cache

Explanation

Question 57 of 76

1

207. Which one of the following is the address generated by CPU?

Select one of the following:

  • ● none of the above

  • ● absolute address

  • ● physical address

  • ● logical address

Explanation

Question 58 of 76

1

208. Runtime mapping from virtual to physical address is done by?

Select one of the following:

  • ● PCI

  • ● memory management unit

  • ● none of the above

  • ● CPU

Explanation

Question 59 of 76

1

209. The address of a page table in memory is pointed by:

Select one of the following:

  • ● program counter

  • ● page register

  • ● stack pointer

  • ● page table base register

Explanation

Question 60 of 76

1

210. Program always deals with:

Select one of the following:

  • ● absolute address

  • ● relative address

  • ● physical address

  • ● logical address

Explanation

Question 61 of 76

1

211. What is compaction?

Select one of the following:

  • ● a technique for overcoming external fragmentation

  • ● a technique for overcoming internal fragmentation

  • ● a technique for overcoming fatal error

  • ● a paging technique

Explanation

Question 62 of 76

1

212. Operating System maintains the page table for:

Select one of the following:

  • ● each address

  • ● each instruction

  • ● each thread

  • ● each process

Explanation

Question 63 of 76

1

213. In contiguous memory allocation:

Select one of the following:

  • ● 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

Explanation

Question 64 of 76

1

214. When memory is divided into several fixed sized partitions, each
partition may contain ________.

Select one of the following:

  • ● multiple processes at once

  • ● at least one process

  • ● none of the above

  • ● exactly one process

Explanation

Question 65 of 76

1

215. In fixed sized partition, the degree of multiprogramming is bounded by
___________.

Select one of the following:

  • ● the CPU utilization

  • ● the number of partitions

  • ● all of the above

  • ● the memory size

Explanation

Question 66 of 76

1

216. The first fit, best fit and worst fit are strategies to select a ______.

Select one of the following:

  • ● 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

Explanation

Question 67 of 76

1

217. In internal fragmentation, memory is internal to a partition and:

Select one of the following:

  • ● is being used

  • ● is always used

  • ● none of the above

  • ● is not being used

Explanation

Question 68 of 76

1

218. A solution to the problem of external fragmentation is:

Select one of the following:

  • ● smaller memory space

  • ● unequal size parts

  • ● larger memory size

  • ● compaction

Explanation

Question 69 of 76

1

219. __________ is generally faster than _________ .

Select one of the following:

  • ● none of the above

  • ● first fit, best fit

  • ● best fit, first fit

  • ● worst fit, best fit

Explanation

Question 70 of 76

1

220. External fragmentation exists when:

Select one of the following:

  • ● 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

Explanation

Question 71 of 76

1

221. External fragmentation will not occur when:

Select one of the following:

  • ● next fit is used

  • ● best fit is used

  • ● first fit is used

  • ● no matter which algorithm is used, it will always occur

Explanation

Question 72 of 76

1

222. When the memory allocated to a process is slightly larger than the
process, then:

Select one of the following:

  • ● none of the above

  • ● internal fragmentation occurs

  • ● external fragmentation occurs

  • ● both will occur

Explanation

Question 73 of 76

1

223. Main memory is broken into fixed-sized blocks called ________.:

Select one of the following:

  • ● segments

  • ● frames

  • ● pages

  • ● none of the above

Explanation

Question 74 of 76

1

224. Fixed-length block of data in secondary memory is called ________.:

Select one of the following:

  • ● pages

  • segments

  • ● frames

  • ● none of the above

Explanation

Question 75 of 76

1

225. Variable-length block of data that resides in secondary memory is called
________.

Select one of the following:

  • ● pages

  • ● segments

  • ● frames

  • ● none of the above

Explanation

Question 76 of 76

1

226. Every address generated by the CPU is divided into two parts:

Select one or more of the following:

  • ● page offset

  • ● frame bit

  • ● page number

  • ● frame offset

Explanation

Previous
Check answer
Next