2.0

Descripción

Quiz on 2.0, created by Little Johnny on 20/12/2017.
Little  Johnny
Test por Little Johnny, actualizado hace más de 1 año
Little  Johnny
Creado por Little Johnny hace más de 6 años
12
0

Resumen del Recurso

Pregunta 1

Pregunta
158. Choose the characteristics of Harvard architecture
Respuesta
  • 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

Pregunta 2

Pregunta
159. Which of the following architectures differs by memory accessing?
Respuesta
  • Von Neumann
  • Harvard
  • Complex Instruction Set Computers
  • Reduced Instruction Set Computers

Pregunta 3

Pregunta
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
Respuesta
  • Microcontroller
  • General purpose microprocessor

Pregunta 4

Pregunta
161. Choose the correct syntax of assembly statements
Respuesta
  • name operation operand(s) comments
  • operation name operand(s) comments
  • operation operand(s) name comments
  • comments name operation operand(s)

Pregunta 5

Pregunta
163. Name field of assembly statement is not case sensitive
Respuesta
  • True
  • False

Pregunta 6

Pregunta
164. Choose the legal name(s) in assembly
Respuesta
  • @variable_name
  • variable?
  • variable&name
  • variable name
  • 1variable

Pregunta 7

Pregunta
165. In two-operand instruction, the first operand is source and the second operand is destination
Respuesta
  • True
  • False

Pregunta 8

Pregunta
166. An instruction may have one or more operands
Respuesta
  • True
  • False

Pregunta 9

Pregunta
167. In assembly language you can express data only in binary and decimal
Respuesta
  • True
  • False

Pregunta 10

Pregunta
168. You should use a radix symbol in order to differentiate between binary, octal or hexadecimal
Respuesta
  • True
  • False

Pregunta 11

Pregunta
169. Which symbol you should use to leave the variable uninitialized
Respuesta
  • ?
  • !
  • @
  • $

Pregunta 12

Pregunta
170. In assembly language, you can skip the name of variable
Respuesta
  • True
  • False

Pregunta 13

Pregunta
171. Choose the correct syntax of variable declaration in assembly
Respuesta
  • variable_name type initial_value
  • type variable_name initial_vaule
  • type initial_value variable_name

Pregunta 14

Pregunta
173. Choose the definition of code segment in assembly
Respuesta
  • Contains a program’s instructions
  • A block of memory to store a stack
  • All variable definitions

Pregunta 15

Pregunta
174. Choose the definition of data segment in assembly
Respuesta
  • All variable definitions
  • A block of memory to store a stack
  • Contains a program’s instructions

Pregunta 16

Pregunta
175. Choose the definition of stack segment in assembly
Respuesta
  • A block of memory to store a stack
  • All variable definitions
  • Contains a program’s instructions

Pregunta 17

Pregunta
176. There is no memory allocated for constants in assembly language
Respuesta
  • True
  • False

Pregunta 18

Pregunta
177. Which keyword you should use in order to define a constant in assembly language
Respuesta
  • EQU
  • DD
  • CONST
  • EQ
  • DW

Pregunta 19

Pregunta
178. In assembly statement name and comment are mandatory
Respuesta
  • True
  • False

Pregunta 20

Pregunta
179. How many deadlock recovery algorithms are there?
Respuesta
  • 4
  • 3
  • 2
  • 5
  • 1

Pregunta 21

Pregunta
180. There are 3 approaches of deadlock avoidance
Respuesta
  • True
  • False

Pregunta 22

Pregunta
181. There are 2 policies of deadlock prevention
Respuesta
  • True
  • False

Pregunta 23

Pregunta
182. Choose the correct approach for the following definition "involves recognizing when deadlock has occurred, and trying to recover"
Respuesta
  • Deadlock detection and recovery
  • Deadlock avoidance
  • Deadlock prevention

Pregunta 24

Pregunta
183. Choose the correct approach for the following definition "involves making dynamic choices that guarantee prevention"
Respuesta
  • Deadlock avoidance
  • Deadlock prevention
  • Deadlock detection and recovery

Pregunta 25

Pregunta
184. Choose the correct approach for the following definition "adopting a static policy that disallows one of the four conditions above"
Respuesta
  • Deadlock prevention
  • Deadlock detection and recovery
  • Deadlock avoidance

Pregunta 26

Pregunta
185. There are 4 approaches of dealing with deadlock
Respuesta
  • True
  • False

Pregunta 27

Pregunta
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"
Respuesta
  • Circular wait
  • Mutual exclusion
  • No preemption
  • Hold and wait

Pregunta 28

Pregunta
187. Choose the correct answer for the following definition: "No process can be forced to release a resource"
Respuesta
  • No preemption
  • Mutual exclusion
  • Hold and wait
  • Circular wait

Pregunta 29

Pregunta
188. Choose the correct answer for the following definition "A process may hold some resources while waiting for others"
Respuesta
  • Hold and wait
  • Mutual exclusion
  • Circular wait
  • No pre-emption

Pregunta 30

Pregunta
Choose the correct answer for the following definition "Only one process may use a resource at one time"
Respuesta
  • Mutual exclusion
  • Circular wait
  • No preemption
  • Hold and wait

Pregunta 31

Pregunta
190. How many policy conditions for deadlock to be possible are there?
Respuesta
  • 3
  • 4
  • 2
  • 1

Pregunta 32

Pregunta
191. What is the deadlock?
Respuesta
  • 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

Pregunta 33

Pregunta
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
Respuesta
  • True
  • False

Pregunta 34

Pregunta
193. In which of the following approaches there is no shared data?
Respuesta
  • Message passing
  • Mutual exclusion
  • Monitors
  • Semaphores

Pregunta 35

Pregunta
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"
Respuesta
  • Message passing
  • Mutual exclusion
  • Monitors
  • Semaphores

Pregunta 36

Pregunta
195. Monitors are similar to classes in java and has methods and fields
Respuesta
  • True
  • False

Pregunta 37

Pregunta
196. In atomic operations semSignal(x) and semWait(x), what is the 'x'?
Respuesta
  • The number of processes that can execute critical section
  • The number of processes
  • The number of monitors
  • No correct answer

Pregunta 38

Pregunta
197. When using semaphores, processes communicate using messages
Respuesta
  • True
  • False

Pregunta 39

Pregunta
198. We can implement mutex through the OS or using programming languages
Respuesta
  • True
  • False

Pregunta 40

Pregunta
199. How many approaches of mutex implementation are there?
Respuesta
  • 3
  • 4
  • 2
  • 5
  • 1

Pregunta 41

Pregunta
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"
Respuesta
  • Mutual exclusion
  • Semaphores
  • Monitors
  • Message passing
  • Critical section

Pregunta 42

Pregunta
201. In concurrency optimal allocation of resources is difficult
Respuesta
  • True
  • False

Pregunta 43

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

Pregunta 44

Pregunta
203. In concurrency, sharing global resources safely is difficult
Respuesta
  • True
  • False

Pregunta 45

Pregunta
204. Concurrency offers genuine simultaneous execution
Respuesta
  • True
  • False

Pregunta 46

Pregunta
205. Parallelism is interleaving of processes in time to give the appearance of simultaneous execution
Respuesta
  • True
  • False

Pregunta 47

Pregunta
206. Choose the correct answer for the following definition "multiple processes on multiple systems"
Respuesta
  • Distributed processing
  • Multiprogramming
  • Multiprocessing

Pregunta 48

Pregunta
207. Choose the correct answer for the following definition "multiple processes on a system with multiple processors"
Respuesta
  • Multiprocessing
  • Multiprogramming
  • Distributed processing

Pregunta 49

Pregunta
208. Choose the correct answer for the following definition "multiple processes on a system with a single processor"
Respuesta
  • Multiprogramming
  • Multiprocessing
  • Distributed processing

Pregunta 50

Pregunta
209. How many categories of process management are there?
Respuesta
  • 3
  • 4
  • 1
  • 2
Mostrar resumen completo Ocultar resumen completo

Similar

HISTORIA DE LAS WEB 1.0, 2.0, 3.0, 4.0.
Maria Alejandra Linares Cobos
science unit B
Joyce Bukmeier
Evolución hiatórica de la web
ELITA CASASOLA
Mapa mental web 2.0
oscar_bs
ÁLGEBRA
JL Cadenas
CIUDADES I...
JL Cadenas
Preguntas Módulo de Promoción de la Salud y Prevención de la Enfermedad
D. Valenzuela
Mapa Mental de Competencias Comunicativas del Español: Estructura de la Lengua
Raúl Fox
LA BELLE EPOQUE
fer.sagredo
Sucesiones Aritméticas (Aplicaciones)
Elaine del Valle
DICTADO RÍTMICO 4 TIEMPOS
mariajesus camino