2.0

Description

Quiz on 2.0, created by Little Johnny on 20/12/2017.
Little  Johnny
Quiz by Little Johnny, updated more than 1 year ago
Little  Johnny
Created by Little Johnny over 6 years ago
12
0

Resource summary

Question 1

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

Question 2

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

Question 3

Question
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
Answer
  • Microcontroller
  • General purpose microprocessor

Question 4

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

Question 5

Question
163. Name field of assembly statement is not case sensitive
Answer
  • True
  • False

Question 6

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

Question 7

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

Question 8

Question
166. An instruction may have one or more operands
Answer
  • True
  • False

Question 9

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

Question 10

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

Question 11

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

Question 12

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

Question 13

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

Question 14

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

Question 15

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

Question 16

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

Question 17

Question
176. There is no memory allocated for constants in assembly language
Answer
  • True
  • False

Question 18

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

Question 19

Question
178. In assembly statement name and comment are mandatory
Answer
  • True
  • False

Question 20

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

Question 21

Question
180. There are 3 approaches of deadlock avoidance
Answer
  • True
  • False

Question 22

Question
181. There are 2 policies of deadlock prevention
Answer
  • True
  • False

Question 23

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

Question 24

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

Question 25

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

Question 26

Question
185. There are 4 approaches of dealing with deadlock
Answer
  • True
  • False

Question 27

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

Question 28

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

Question 29

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

Question 30

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

Question 31

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

Question 32

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

Question 33

Question
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
Answer
  • True
  • False

Question 34

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

Question 35

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

Question 36

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

Question 37

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

Question 38

Question
197. When using semaphores, processes communicate using messages
Answer
  • True
  • False

Question 39

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

Question 40

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

Question 41

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

Question 42

Question
201. In concurrency optimal allocation of resources is difficult
Answer
  • True
  • False

Question 43

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

Question 44

Question
203. In concurrency, sharing global resources safely is difficult
Answer
  • True
  • False

Question 45

Question
204. Concurrency offers genuine simultaneous execution
Answer
  • True
  • False

Question 46

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

Question 47

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

Question 48

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

Question 49

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

Question 50

Question
209. How many categories of process management are there?
Answer
  • 3
  • 4
  • 1
  • 2
Show full summary Hide full summary

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
Law of Tort - General Negligence
Sophie.J.E
The Rise of the Nazis
absterps18
AQA - English Language Unit 1
Alice Love
Physics equations GCSE
Mia Jones
Physics P1
Phoebe Drew
Health and Social Care Flashcards
Kelsey Phillips
Language Techniques
Anna Wolski