Little Johnny
Quiz by , created more than 1 year ago

Quiz on 2.0, created by Little Johnny on 20/12/2017.

15
0
0
Little Johnny
Created by Little Johnny almost 7 years ago
Close

2.0

Question 1 of 50

1

158. Choose the characteristics of Harvard architecture

Select one or more of the following:

  • separate program and data memories

  • separated buses allow one instruction to execute while the next instruction is fetched

  • data and instructions mustn’t have the same width

  • one memory for data and program

  • CPU provides address to get data or instruction

  • data and instructions must have the same width

Explanation

Question 2 of 50

1

159. Which of the following architectures differs by memory accessing?

Select one or more of the following:

  • Von Neumann

  • Harvard

  • Complex Instruction Set Computers

  • Reduced Instruction Set Computers

Explanation

Question 3 of 50

1

160. Choose the correct answer for the following characteristics: 1. Depend mainly on its peripherals 2. Used for a few dedicated functions 3. Usually used as a part of a larger system

Select one of the following:

  • Microcontroller

  • General purpose microprocessor

Explanation

Question 4 of 50

1

161. Choose the correct syntax of assembly statements

Select one of the following:

  • name operation operand(s) comments

  • operation name operand(s) comments

  • operation operand(s) name comments

  • comments name operation operand(s)

Explanation

Question 5 of 50

1

163. Name field of assembly statement is not case sensitive

Select one of the following:

  • True
  • False

Explanation

Question 6 of 50

1

164. Choose the legal name(s) in assembly

Select one or more of the following:

  • @variable_name

  • variable?

  • variable&name

  • variable name

  • 1variable

Explanation

Question 7 of 50

1

165. In two-operand instruction, the first operand is source and the second operand is destination

Select one of the following:

  • True
  • False

Explanation

Question 8 of 50

1

166. An instruction may have one or more operands

Select one of the following:

  • True
  • False

Explanation

Question 9 of 50

1

167. In assembly language you can express data only in binary and decimal

Select one of the following:

  • True
  • False

Explanation

Question 10 of 50

1

168. You should use a radix symbol in order to differentiate between binary, octal or hexadecimal

Select one of the following:

  • True
  • False

Explanation

Question 11 of 50

1

169. Which symbol you should use to leave the variable uninitialized

Select one of the following:

  • ?

  • !

  • @

  • $

Explanation

Question 12 of 50

1

170. In assembly language, you can skip the name of variable

Select one of the following:

  • True
  • False

Explanation

Question 13 of 50

1

171. Choose the correct syntax of variable declaration in assembly

Select one of the following:

  • variable_name type initial_value

  • type variable_name initial_vaule

  • type initial_value variable_name

Explanation

Question 14 of 50

1

173. Choose the definition of code segment in assembly

Select one of the following:

  • Contains a program’s instructions

  • A block of memory to store a stack

  • All variable definitions

Explanation

Question 15 of 50

1

174. Choose the definition of data segment in assembly

Select one of the following:

  • All variable definitions

  • A block of memory to store a stack

  • Contains a program’s instructions

Explanation

Question 16 of 50

1

175. Choose the definition of stack segment in assembly

Select one of the following:

  • A block of memory to store a stack

  • All variable definitions

  • Contains a program’s instructions

Explanation

Question 17 of 50

1

176. There is no memory allocated for constants in assembly language

Select one of the following:

  • True
  • False

Explanation

Question 18 of 50

1

177. Which keyword you should use in order to define a constant in assembly language

Select one of the following:

  • EQU

  • DD

  • CONST

  • EQ

  • DW

Explanation

Question 19 of 50

1

178. In assembly statement name and comment are mandatory

Select one of the following:

  • True
  • False

Explanation

Question 20 of 50

1

179. How many deadlock recovery algorithms are there?

Select one of the following:

  • 4

  • 3

  • 2

  • 5

  • 1

Explanation

Question 21 of 50

1

180. There are 3 approaches of deadlock avoidance

Select one of the following:

  • True
  • False

Explanation

Question 22 of 50

1

181. There are 2 policies of deadlock prevention

Select one of the following:

  • True
  • False

Explanation

Question 23 of 50

1

182. Choose the correct approach for the following definition "involves recognizing when deadlock has occurred, and trying to recover"

Select one of the following:

  • Deadlock detection and recovery

  • Deadlock avoidance

  • Deadlock prevention

Explanation

Question 24 of 50

1

183. Choose the correct approach for the following definition "involves making dynamic choices that guarantee prevention"

Select one of the following:

  • Deadlock avoidance

  • Deadlock prevention

  • Deadlock detection and recovery

Explanation

Question 25 of 50

1

184. Choose the correct approach for the following definition "adopting a static policy that disallows one of the four conditions above"

Select one of the following:

  • Deadlock prevention

  • Deadlock detection and recovery

  • Deadlock avoidance

Explanation

Question 26 of 50

1

185. There are 4 approaches of dealing with deadlock

Select one of the following:

  • True
  • False

Explanation

Question 27 of 50

1

186. Choose the correct answer for the following definition "A closed chain of processes exists, such that each process is blocked waiting for a resource held by another process in the set"

Select one of the following:

  • Circular wait

  • Mutual exclusion

  • No preemption

  • Hold and wait

Explanation

Question 28 of 50

1

187. Choose the correct answer for the following definition: "No process can be forced to release a resource"

Select one of the following:

  • No preemption

  • Mutual exclusion

  • Hold and wait

  • Circular wait

Explanation

Question 29 of 50

1

188. Choose the correct answer for the following definition "A process may hold some resources while waiting for others"

Select one of the following:

  • Hold and wait

  • Mutual exclusion

  • Circular wait

  • No pre-emption

Explanation

Question 30 of 50

1

Choose the correct answer for the following definition "Only one process may use a resource at one time"

Select one of the following:

  • Mutual exclusion

  • Circular wait

  • No preemption

  • Hold and wait

Explanation

Question 31 of 50

1

190. How many policy conditions for deadlock to be possible are there?

Select one of the following:

  • 3

  • 4

  • 2

  • 1

Explanation

Question 32 of 50

1

191. What is the deadlock?

Select one of the following:

  • Permanent blocking of a set of processes that either compete for global resources or communicate with each other

  • Interleaving of processes in time to give the appearance of simultaneous execution

  • When one process is inside a critical section of code, other processes must be prevented from entering that section

  • Processes “communicate” via global counters that are initialized to a positive integer and that can be accessed only through two atomic operations

Explanation

Question 33 of 50

1

192. Deadlock occurs when each process in the set is blocked awaiting an event that can be triggered only by another blocked process in the set

Select one of the following:

  • True
  • False

Explanation

Question 34 of 50

1

193. In which of the following approaches there is no shared data?

Select one of the following:

  • Message passing

  • Mutual exclusion

  • Monitors

  • Semaphores

Explanation

Question 35 of 50

1

194. Choose the correct answer for the following definition "Synchronization between processes is defined by the blocking policy attached to the sending and receiving of messages"

Select one of the following:

  • Message passing

  • Mutual exclusion

  • Monitors

  • Semaphores

Explanation

Question 36 of 50

1

195. Monitors are similar to classes in java and has methods and fields

Select one of the following:

  • True
  • False

Explanation

Question 37 of 50

1

196. In atomic operations semSignal(x) and semWait(x), what is the 'x'?

Select one of the following:

  • The number of processes that can execute critical section

  • The number of processes

  • The number of monitors

  • No correct answer

Explanation

Question 38 of 50

1

197. When using semaphores, processes communicate using messages

Select one of the following:

  • True
  • False

Explanation

Question 39 of 50

1

198. We can implement mutex through the OS or using programming languages

Select one of the following:

  • True
  • False

Explanation

Question 40 of 50

1

199. How many approaches of mutex implementation are there?

Select one of the following:

  • 3

  • 4

  • 2

  • 5

  • 1

Explanation

Question 41 of 50

1

200. Choose the correct answer for the following definition "When one process is inside a critical section of code, other processes must be prevented from entering that section"

Select one of the following:

  • Mutual exclusion

  • Semaphores

  • Monitors

  • Message passing

  • Critical section

Explanation

Question 42 of 50

1

201. In concurrency optimal allocation of resources is difficult

Select one of the following:

  • True
  • False

Explanation

Question 43 of 50

1

202. In concurrency, locating programming errors can't be difficult, because the contexts in which errors occur cannot always be reproduced easily

Select one of the following:

  • True
  • False

Explanation

Question 44 of 50

1

203. In concurrency, sharing global resources safely is difficult

Select one of the following:

  • True
  • False

Explanation

Question 45 of 50

1

204. Concurrency offers genuine simultaneous execution

Select one of the following:

  • True
  • False

Explanation

Question 46 of 50

1

205. Parallelism is interleaving of processes in time to give the appearance of simultaneous execution

Select one of the following:

  • True
  • False

Explanation

Question 47 of 50

1

206. Choose the correct answer for the following definition "multiple processes on multiple systems"

Select one of the following:

  • Distributed processing

  • Multiprogramming

  • Multiprocessing

Explanation

Question 48 of 50

1

207. Choose the correct answer for the following definition "multiple processes on a system with multiple processors"

Select one of the following:

  • Multiprocessing

  • Multiprogramming

  • Distributed processing

Explanation

Question 49 of 50

1

208. Choose the correct answer for the following definition "multiple processes on a system with a single processor"

Select one of the following:

  • Multiprogramming

  • Multiprocessing

  • Distributed processing

Explanation

Question 50 of 50

1

209. How many categories of process management are there?

Select one of the following:

  • 3

  • 4

  • 1

  • 2

Explanation

Previous
Check answer
Next