158. Choose the characteristics of Harvard architecture
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
159. Which of the following architectures differs by memory accessing?
Von Neumann
Harvard
Complex Instruction Set Computers
Reduced Instruction Set Computers
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
Microcontroller
General purpose microprocessor
161. Choose the correct syntax of assembly statements
name operation operand(s) comments
operation name operand(s) comments
operation operand(s) name comments
comments name operation operand(s)
163. Name field of assembly statement is not case sensitive
164. Choose the legal name(s) in assembly
@variable_name
variable?
variable&name
variable name
1variable
165. In two-operand instruction, the first operand is source and the second operand is destination
166. An instruction may have one or more operands
167. In assembly language you can express data only in binary and decimal
168. You should use a radix symbol in order to differentiate between binary, octal or hexadecimal
169. Which symbol you should use to leave the variable uninitialized
?
!
@
$
170. In assembly language, you can skip the name of variable
171. Choose the correct syntax of variable declaration in assembly
variable_name type initial_value
type variable_name initial_vaule
type initial_value variable_name
173. Choose the definition of code segment in assembly
Contains a program’s instructions
A block of memory to store a stack
All variable definitions
174. Choose the definition of data segment in assembly
175. Choose the definition of stack segment in assembly
176. There is no memory allocated for constants in assembly language
177. Which keyword you should use in order to define a constant in assembly language
EQU
DD
CONST
EQ
DW
178. In assembly statement name and comment are mandatory
179. How many deadlock recovery algorithms are there?
4
3
2
5
1
180. There are 3 approaches of deadlock avoidance
181. There are 2 policies of deadlock prevention
182. Choose the correct approach for the following definition "involves recognizing when deadlock has occurred, and trying to recover"
Deadlock detection and recovery
Deadlock avoidance
Deadlock prevention
183. Choose the correct approach for the following definition "involves making dynamic choices that guarantee prevention"
184. Choose the correct approach for the following definition "adopting a static policy that disallows one of the four conditions above"
185. There are 4 approaches of dealing with deadlock
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"
Circular wait
Mutual exclusion
No preemption
Hold and wait
187. Choose the correct answer for the following definition: "No process can be forced to release a resource"
188. Choose the correct answer for the following definition "A process may hold some resources while waiting for others"
No pre-emption
Choose the correct answer for the following definition "Only one process may use a resource at one time"
190. How many policy conditions for deadlock to be possible are there?
191. What is the deadlock?
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
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
193. In which of the following approaches there is no shared data?
Message passing
Monitors
Semaphores
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"
195. Monitors are similar to classes in java and has methods and fields
196. In atomic operations semSignal(x) and semWait(x), what is the 'x'?
The number of processes that can execute critical section
The number of processes
The number of monitors
No correct answer
197. When using semaphores, processes communicate using messages
198. We can implement mutex through the OS or using programming languages
199. How many approaches of mutex implementation are there?
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"
Critical section
201. In concurrency optimal allocation of resources is difficult
202. In concurrency, locating programming errors can't be difficult, because the contexts in which errors occur cannot always be reproduced easily
203. In concurrency, sharing global resources safely is difficult
204. Concurrency offers genuine simultaneous execution
205. Parallelism is interleaving of processes in time to give the appearance of simultaneous execution
206. Choose the correct answer for the following definition "multiple processes on multiple systems"
Distributed processing
Multiprogramming
Multiprocessing
207. Choose the correct answer for the following definition "multiple processes on a system with multiple processors"
208. Choose the correct answer for the following definition "multiple processes on a system with a single processor"
209. How many categories of process management are there?