MockTest3.docx

Revision for your Resit Test

Your third test is based on lectures 14 to 21. The actual test consists of 30 multiple choice questions only.

  1. A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________

  2. Data consistency

  3. Race condition

  4. Aging

  5. Starvation

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

  7. Program

  8. Critical section

  9. Non – critical section

  10. Synchronizing

  11. Which of the following conditions must be satisfied to solve the critical section problem?

  12. Mutual Exclusion

  13. Progress

  14. Bounded Waiting

  15. All of the above

  16. Mutual exclusion implies that ____________

  17. If a process is executing in its critical section, then no other process must be executing in their critical sections

  18. If a process is executing in its critical section, then other processes must be executing in their critical sections

  19. If a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

  20. None of the above

  21. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________

  22. After a process has made a request to enter its critical section and before the request is granted

  23. When another process is in its critical section

  24. Before a process has made a request to enter its critical section

  25. None of the above

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

  27. Hardware for a system

  28. Special program for a system

  29. Integer variable

  30. None of the above

  31. What are the two kinds of semaphores?

  32. Mutex & counting

  33. Binary & counting

  34. Counting & decimal

  35. Decimal & binary

  36. The dining – philosophers problem will occur in case of ____________

  37. 5 philosophers and 5 forks

  38. 4 philosophers and 5 forks

  39. 3 philosophers and 5 forks

  40. 6 philosophers and 5 forks

  41. A monitor is a type of ____________

  42. Semaphore

  43. Low level synchronization construct

  44. High level synchronization construct

  45. None of the above

  46. The monitor construct ensures that ____________

  47. Only one process can be active at a time within the monitor

  48. n number of processes can be active at a time within the monitor (n being greater than 1)

  49. The queue has only one process in it at a time

  50. All of the above

  51. What are the operations that can be invoked on a condition variable?

  52. hold & wait

  53. Signal & hold

  54. Continue & signal

  55. Wait & signal

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

  57. Mutual exclusion

  58. A process may hold allocated resources while awaiting assignment of other resources

  59. no resource can be forcibly removed from a process holding it

  60. All of the above

  61. A system is in the safe state if ____________

  62. The system can allocate resources to each process in some order and still avoid a deadlock

  63. There exist a safe sequence

  64. All of the above

  65. None of the above

  66. The circular wait condition can be prevented by ____________

  67. Using thread

  68. Defining a linear ordering of resource types

  69. Using pipes

  70. All of the above

  71. A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________

  72. Deadlock

  73. Starvation

  74. Inversion

  75. Aging

  76. What is Address Binding?

  77. Going to an address in memory

  78. Locating an address with the help of another address

  79. Binding two addresses together to form a new address in a different memory space

  80. A mapping from one address space to another

  81. Binding of instructions and data to memory addresses can be done at ____________

  82. Compile time

  83. Load time

  84. Execution time

  85. All of the above

  86. If the process can be moved during its execution from one memory segment to another, then binding must be ____________

  87. Delayed until run time

  88. Preponed to compile time

  89. Preponed to load time

  90. None of the above

  91. What is Dynamic loading?

  92. Loading multiple routines dynamically

  93. Loading a routine only when it is called

  94. Loading multiple routines randomly

  95. None of the above

  96. What is the advantage of dynamic loading?

  97. A used routine is used multiple times

  98. An unused routine is never loaded

  99. CPU utilization increases

  100. All of the above

  101. If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?

  102. Priority swapping

  103. Pull out, push in

  104. Roll out, roll in

  105. None of the above

  106. The address generated by the CPU is referred to as ____________

  107. Physical address

  108. Logical address

  109. Neither physical nor logical

  110. None of the above

  111. Which of the following are forms of malicious attack?

  112. Theft of information

  113. Modification of data

  114. Wiping of information

  115. All of the above

  116. The address loaded into the memory address register of the memory is referred to as ____________

  117. Physical address

  118. Logical address

  119. Neither physical nor logical

  120. None of the mentioned

  121. The run time mapping from virtual to physical addresses is done by a hardware device called the ____________

  122. Virtual to physical mapper

  123. Memory management unit

  124. Memory mapping unit

  125. None of the above

  126. In contiguous memory allocation ____________

  127. Each process is contained in a single contiguous section of memory

  128. All processes are contained in a single contiguous section of memory

  129. The memory space is contiguous

  130. None of the above

  131. The relocation register helps in ____________

  132. Providing more address space to processes

  133. A different address space to processes

  134. To protect the address spaces of processes

  135. None of the above

  136. Physical memory is broken into fixed-sized blocks called ________

  137. Frames

  138. Pages

  139. Backing store

  140. None of the above

  141. Logical memory is broken into blocks of the same size called ________

  142. Frames

  143. Pages

  144. Backing store

  145. None of the above

  146. The size of a page is typically ____________

  147. Varied

  148. Power of 2

  149. Power of 4

  150. None of the above

  151. When the valid – invalid bit is set to valid, it means that the associated page ____________

  152. Is in the TLB

  153. Has data in it

  154. Is in the process’s logical address space

  155. Is the system’s physical address space

  156. The CPU hardware has a wire called __________ that the CPU senses after executing every instruction.

  157. Interrupt request line

  158. Interrupt bus

  159. Interrupt receive line

  160. Interrupt sense line

  161. The _________ determines the cause of the interrupt, performs the necessary processing and executes a return from the interrupt instruction to return the CPU to the execution state prior to the interrupt.

  162. Interrupt request line

  163. Device driver

  164. Interrupt handler

  165. All of the above

  166. In general the two interrupt request lines are ____________

  167. Maskable & non maskable interrupts

  168. Blocked & non maskable interrupts

  169. Maskable & blocked interrupts

  170. None of the above

  171. For large data transfers, _________ is used.

  172. DMA

  173. Programmed I/O

  174. Controller register

  175. None of the above

  176. What is the breach of integrity?

  177. This type of violation involves unauthorized reading of data

  178. This violation involves unauthorized modification of data

  179. This violation involves unauthorized destruction of data

  180. This violation involves unauthorized use of resources

  181. What is breach of confidentiality?

  182. This type of violation involves unauthorized reading of data

  183. This violation involves unauthorized modification of data

  184. This violation involves unauthorized destruction of data

  185. This violation involves unauthorized use of resources

  186. What is breach of availability?

  187. This type of violation involves unauthorized reading of data

  188. This violation involves unauthorized modification of data

  189. This violation involves unauthorized destruction of data

  190. This violation involves unauthorized use of resources

  191. What is known as a DOS attack?

  192. It is attacked to block traffic of network

  193. It is attacked to harm contents stored in HDD by worm spawn processes

  194. It is an attempt to make a machine or network resource unavailable

  195. None of the above

  196. What is Trojan horse?

  197. It is a useful way to encrypt password

  198. It is a user which steals valuable information

  199. It is a rogue program which tricks users

  200. It’s a brute force attack algorithm

  201. What is trap door?

  202. It is trap door in WarGames

  203. It is a hole in software left by designer

  204. It is a Trojan horse

  205. It is a virus which traps and locks user terminal

  206. Which mechanism is used by worm process?

  207. Trap door

  208. Fake process

  209. Spawn Process

  210. VAX process

  211. What is known as masquerading?

  212. When one participant in communication pretends to be someone else

  213. When attacker modifies data in communication

  214. When attack is of fraudulent repeat of a valid data

  215. When attack gains access to remote systems

  216. What is used to protect network from outside internet access?

  217. A trusted antivirus

  218. 24 hours scanning for virus

  219. Firewall to separate trusted and untrusted network

  220. Deny users access to websites which can potentially cause security leak

  221. Which direction access cannot happen using DMZ zone by default?

  222. Company computer to DMZ

  223. Internet to DMZ

  224. Internet to company computer

  225. Company computer to internet

  226. What are characteristic of Network Operating Systems?

  227. Users are aware of multiplicity of machines

  228. They are transparent

  229. They are simple to use

  230. All of the above

  231. What are the characteristics of Distributed Operating system?

  232. Users are aware of multiplicity of machines

  233. Access is done like local resources

  234. They have multiple zones to access files

  235. None of the above

  236. What are the characteristics of data migration?

  237. Transfer data by entire file or immediate portion required

  238. Transfer the computation rather than the data

  239. Execute an entire process or parts of it at different sites

  240. None of the above

  241. What are the characteristics of process migration?

A.Transfer data by entire file or immediate portion required
B. Transfer the computation rather than the data
C. Execute an entire process or parts of it at different sites
D. None of the above

  1. How many layers does the Internet model ISO consist of?

A.Three
B. Five
C. Seven
D. Eight