MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What are Spinlocks? |
| A. | cpu cycles wasting locks over critical sections of programs |
| B. | locks that avoid time wastage in context switches |
| C. | locks that work better on multiprocessor systems |
| D. | all of the mentioned |
| Answer» E. | |
| 2. |
a process is allowed to enter its critical section                     . |
| A. | . after a process has made a request to enter its critical section and before the request is granted |
| B. | . when another process is in its critical section |
| C. | . before a process has made a request to enter its critical section |
| D. | . none of the mentioned |
| Answer» B. . when another process is in its critical section | |
| 3. |
Which of the following conditions must be satisfied to solve the critical section problem? |
| A. | . mutual exclusion |
| B. | . progress |
| C. | . bounded waiting |
| D. | . all of the mentioned |
| Answer» E. | |
| 4. |
Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a                . |
| A. | . livelock |
| B. | . critical section |
| C. | . deadlock |
| D. | . mutual exclusion |
| Answer» D. . mutual exclusion | |
| 5. |
Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as                  . |
| A. | . livelock |
| B. | . deadlock |
| C. | . synchronization |
| D. | . mutual exclusion |
| Answer» D. . mutual exclusion | |
| 6. |
                    is the ability of multiple processes to co-ordinate their activities by exchange of information. |
| A. | . deadlock |
| B. | . synchronization |
| C. | . mutual exclusion |
| D. | . cache |
| Answer» B. . synchronization | |
| 7. |
code, resources or data in such a way that only one process has access to shared object at a time. |
| A. | . readers_writer locks |
| B. | . barriers |
| C. | . semaphores |
| D. | . mutual exclusion |
| Answer» D. . mutual exclusion | |
| 8. |
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then |
| A. | . better system utilization |
| B. | . deadlock can never occur |
| C. | . responsiveness |
| D. | . faster execution |
| Answer» D. . faster execution | |
| 9. |
How many times will process P0 print '0'? |
| A. | . at least twice |
| B. | . one |
| C. | . three |
| D. | . none of the above |
| Answer» D. . none of the above | |
| 10. |
A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is |
| A. | . 4 |
| B. | . 6 |
| C. | . 9 |
| D. | . 8 |
| Answer» E. | |
| 11. |
A critical section is a program segment                         . |
| A. | . where shared resources are accessed |
| B. | . single thread of execution |
| C. | . improves concurrency in multi-core system |
| D. | . lower resource consumption |
| Answer» E. | |
| 12. |
A semaphore is a shared integer variable                     . |
| A. | . lightweight process |
| B. | . that cannot drop below zero |
| C. | . program counter |
| D. | . stack space |
| Answer» C. . program counter | |
| 13. |
Spinlocks are intended to provide                  only. |
| A. | . mutual exclusion |
| B. | . bounded waiting |
| C. | . aging |
| D. | . progress |
| Answer» C. . aging | |
| 14. |
processes to solve the critical section problem. |
| A. | . one |
| B. | . two |
| C. | . three |
| D. | . four |
| Answer» C. . three | |
| 15. |
To avoid deadlock |
| A. | . there must be a fixed number of resources to allocate |
| B. | . resource allocation must be done only once |
| C. | . all deadlocked processes must be aborted |
| D. | . inversion technique can be used |
| Answer» B. . resource allocation must be done only once | |
| 16. |
All deadlocks involve conflicting needs for |
| A. | . resources |
| B. | . users |
| C. | . computers |
| D. | . programs |
| Answer» B. . users | |
| 17. |
Which one of the following statements describes the properties achieved? |
| A. | . mutual exclusion but not progress |
| B. | . progress but not mutual exclusion |
| C. | . neither mutual exclusion nor progress |
| D. | . both mutual exclusion and progress |
| Answer» B. . progress but not mutual exclusion | |
| 18. |
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: |
| A. | . data consistency |
| B. | . race condition |
| C. | . aging |
| D. | . starvation |
| Answer» C. . aging | |
| 19. |
Producer consumer problem can be solved using |
| A. | . semaphores |
| B. | . event counters |
| C. | . monitors |
| D. | . all of the above |
| Answer» D. . all of the above | |
| 20. |
Alternative way of a snooping-based coherence protocol, is called a |
| A. | . write invalidate protocol |
| B. | . snooping protocol |
| C. | . directory protocol |
| D. | . write update protocol |
| Answer» D. . write update protocol | |
| 21. |
The expression 'delayed load' is used in context of |
| A. | . processor-printer communication |
| B. | . memory-monitor communication |
| C. | . pipelining |
| D. | . none of the above |
| Answer» D. . none of the above | |
| 22. |
During the execution of the instructions, a copy of the instructions is placed in the           . |
| A. | . register |
| B. | . ram |
| C. | . system heap |
| D. | . cache |
| Answer» D. . cache | |
| 23. |
tasks being performed in different stages : |
| A. | . require different amount of time |
| B. | . require about the same amount of time |
| C. | . require different amount of time with time difference between any two tasks being same |
| D. | . require different amount with time difference between any two tasks being different |
| Answer» B. . require about the same amount of time | |
| 24. |
All nodes in each dimension form a linear array, in the                  . |
| A. | . star topology |
| B. | . ring topology |
| C. | . connect topology |
| D. | . mesh topology |
| Answer» E. | |
| 25. |
If no node having a copy of a cache block, this technique is known as |
| A. | . cached |
| B. | . un-cached |
| C. | . shared data |
| D. | . valid data |
| Answer» E. | |
| 26. |
In shared bus architecture, the required processor(s) to perform a bus cycle, for fetching data or instructions is |
| A. | . one processor |
| B. | . two processor |
| C. | . multi-processor |
| D. | . none of the above |
| Answer» D. . none of the above | |
| 27. |
Parallel programs: Which speedup could be achieved according to Amdahl´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel? |
| A. | . 10 |
| B. | . 20 |
| C. | . 30 |
| D. | . 40 |
| Answer» C. . 30 | |
| 28. |
Systems that do not have parallel processing capabilities are |
| A. | . sisd |
| B. | . mimd |
| C. | . simd |
| D. | . misd |
| Answer» E. | |
| 29. |
The idea of cache memory is based |
| A. | . on the property of locality of reference |
| B. | . on the heuristic 90-10 rule |
| C. | . on the fact that references generally tend to cluster |
| D. | . all of the above |
| Answer» D. . all of the above | |