MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 62 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
____________ 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» C. Mutual Exclusion | |
| 52. |
How does the difference between the logical view and the reality of parallel architectures affect parallelization? |
| A. | Performance |
| B. | Latency |
| C. | Bandwidth |
| D. | Accuracy |
| Answer» B. Latency | |
| 53. |
_______________ causes no synchronization overhead and can maintain data locality when data fits in cache. |
| A. | Guided |
| B. | Auto |
| C. | Runtime |
| D. | Static |
| Answer» E. | |
| 54. |
__________________ is a nonnegative integer that the destination can use to selectively screen messages. |
| A. | Dest |
| B. | Type |
| C. | Address |
| D. | length |
| Answer» C. Address | |
| 55. |
How many assembly instructions does the following C instruction take? global_count += 5; |
| A. | 4 instructions |
| B. | 3 instructions |
| C. | 5 instructions |
| D. | 2 instructions |
| Answer» B. 3 instructions | |
| 56. |
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» C. Responsiveness | |
| 57. |
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» B. Deadlock | |
| 58. |
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called ___________. |
| A. | Out-of-order execution |
| B. | Hardware prefetching |
| C. | Software prefetching |
| D. | mutual exclusion |
| Answer» E. | |
| 59. |
Pthreads has a nonblocking version of pthreads_mutex_lock called __________ |
| A. | pthread_mutex_lock |
| B. | pthread_mutex_trylock |
| C. | pthread_mutex_acquirelock |
| D. | pthread_mutex_releaselock |
| Answer» C. pthread_mutex_acquirelock | |
| 60. |
What are the algorithms for identifying which subtrees we assign to the processes or threads __________ |
| A. | breadth-first search |
| B. | depth-first search |
| C. | depth-first search breadth-first search |
| D. | None of the above |
| Answer» D. None of the above | |
| 61. |
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» E. | |
| 62. |
The concept of pipelining is most effective in improving performance if the 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» C. require different amount of time with time difference between any two tasks being same | |