McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 101. |
In a broadcast and reduction on a balanced binary tree reduction is done in ______ |
| A. | recursive order |
| B. | straight order |
| C. | vertical order |
| D. | parallel order |
| Answer» A. recursive order | |
| 102. |
if "X" is the message to broadcast it initially resides at the source node |
| A. | 1 |
| B. | 2 |
| C. | 8 |
| D. | 0 |
| Answer» D. 0 | |
| 103. |
logical operators used in algorithm are |
| A. | xor |
| B. | and |
| C. | both |
| D. | none |
| Answer» C. both | |
| 104. |
Generalization of broadcast in Which each processor is |
| A. | source as well as destination |
| B. | only source |
| C. | only destination |
| D. | none |
| Answer» A. source as well as destination | |
| 105. |
The algorithm terminates in _____ steps |
| A. | p |
| B. | p+1 |
| C. | p+2 |
| D. | p-1 |
| Answer» D. p-1 | |
| 106. |
Each node first sends to one of its neighbours the data it need to.... |
| A. | broadcast |
| B. | identify |
| C. | verify |
| D. | none |
| Answer» A. broadcast | |
| 107. |
The second communication phase is a columnwise ______ broadcast of consolidated |
| A. | all-to-all |
| B. | one -to-all |
| C. | all-to-one |
| D. | point-to-point |
| Answer» A. all-to-all | |
| 108. |
All nodes collects _____ message corresponding to √p nodes to their respectively |
| A. | √p |
| B. | p |
| C. | p+1 |
| D. | p-1 |
| Answer» A. √p | |
| 109. |
It is not possible to port ____ for higher dimensional network |
| A. | algorithm |
| B. | hypercube |
| C. | both |
| D. | none |
| Answer» A. algorithm | |
| 110. |
If we port algorithm to higher dimemsional network it would cause |
| A. | error |
| B. | contention |
| C. | recursion |
| D. | none |
| Answer» B. contention | |
| 111. |
In the scatter operation ____ node send message to every other node |
| A. | single |
| B. | double |
| C. | triple |
| D. | none |
| Answer» A. single | |
| 112. |
The gather Operation is exactly the inverse of _____ |
| A. | scatter operation |
| B. | recursion operation |
| C. | execution |
| D. | none |
| Answer» A. scatter operation | |
| 113. |
Similar communication pattern to all-to-all broadcast except in the_____ |
| A. | reverse order |
| B. | parallel order |
| C. | straight order |
| D. | vertical order |
| Answer» A. reverse order | |
| 114. |
Group communication operations are built using which primitives? |
| A. | one to all |
| B. | all to all |
| C. | point to point |
| D. | none of these |
| Answer» C. point to point | |
| 115. |
___ can be performed in an identical fashion by inverting the process. |
| A. | recursive doubling |
| B. | reduction |
| C. | broadcast |
| D. | none of these |
| Answer» B. reduction | |
| 116. |
Broadcast and reduction operations on a mesh is performed |
| A. | along the rows |
| B. | along the columns |
| C. | both a and b concurrently |
| D. | none of these |
| Answer» C. both a and b concurrently | |
| 117. |
Cost Analysis on a ring is |
| A. | (ts + twm)(p - 1) |
| B. | (ts - twm)(p + 1) |
| C. | (tw + tsm)(p - 1) |
| D. | (tw - tsm)(p + 1) |
| Answer» A. (ts + twm)(p - 1) | |
| 118. |
Cost Analysis on a mesh is |
| A. | 2ts(sqrt(p) + 1) + twm(p - 1) |
| B. | 2tw(sqrt(p) + 1) + tsm(p - 1) |
| C. | 2tw(sqrt(p) - 1) + tsm(p - 1) |
| D. | 2ts(sqrt(p) - 1) + twm(p - 1) |
| Answer» D. 2ts(sqrt(p) - 1) + twm(p - 1) | |
| 119. |
Communication between two directly link nodes |
| A. | cut-through routing |
| B. | store-and-forward routing |
| C. | nearest neighbour communication |
| D. | none |
| Answer» C. nearest neighbour communication | |
| 120. |
All-to-one communication (reduction) is the dual of ______ broadcast. |
| A. | all-to-all |
| B. | one-to-all |
| C. | one-to-one |
| D. | all-to-one |
| Answer» B. one-to-all | |
| 121. |
Which is known as Reduction? |
| A. | all-to-one |
| B. | all-to-all |
| C. | one-to-one |
| D. | one-to-all |
| Answer» A. all-to-one | |
| 122. |
Which is known as Broadcast? |
| A. | one-to-one |
| B. | one-to-all |
| C. | all-to-all |
| D. | all-to-one |
| Answer» B. one-to-all | |
| 123. |
The dual of all-to-all broadcast is |
| A. | all-to-all reduction |
| B. | all-to-one reduction |
| C. | both |
| D. | none |
| Answer» A. all-to-all reduction | |
| 124. |
All-to-all broadcast algorithm for the 2D mesh is based on the |
| A. | linear array algorithm |
| B. | ring algorithm |
| C. | both |
| D. | none |
| Answer» B. ring algorithm | |
| 125. |
In the first phase of 2D Mesh All to All, the message size is ___ |
| A. | p |
| B. | m*sqrt(p) |
| C. | m |
| D. | p*sqrt(m) |
| Answer» C. m | |
| 126. |
In the second phase of 2D Mesh All to All, the message size is ___ |
| A. | m |
| B. | p*sqrt(m) |
| C. | p |
| D. | m*sqrt(p) |
| Answer» D. m*sqrt(p) | |
| 127. |
In All to All on Hypercube, The size of the message to be transmitted at the next step is ____ by concatenating the received message with their current data |
| A. | doubled |
| B. | tripled |
| C. | halfed |
| D. | no change |
| Answer» A. doubled | |
| 128. |
The all-to-all broadcast on Hypercube needs ____ steps |
| A. | p |
| B. | sqrt(p) - 1 |
| C. | log p |
| D. | none |
| Answer» C. log p | |
| 129. |
One-to-All Personalized Communication operation is commonly called ___ |
| A. | gather operation |
| B. | concatenation |
| C. | scatter operation |
| D. | none |
| Answer» C. scatter operation | |
| 130. |
The dual of the scatter operation is the |
| A. | concatenation |
| B. | gather operation |
| C. | both |
| D. | none |
| Answer» C. both | |
| 131. |
In Scatter Operation on Hypercube, on each step, the size of the messages communicated is ____ |
| A. | tripled |
| B. | halved |
| C. | doubled |
| D. | no change |
| Answer» B. halved | |
| 132. |
Which is also called "Total Exchange" ? |
| A. | all-to-all broadcast |
| B. | all-to-all personalized communication |
| C. | all-to-one reduction |
| D. | none |
| Answer» B. all-to-all personalized communication | |
| 133. |
All-to-all personalized communication can be used in ____ |
| A. | fourier transform |
| B. | matrix transpose |
| C. | sample sort |
| D. | all of the above |
| Answer» D. all of the above | |
| 134. |
In collective communication operations, collective means |
| A. | involve group of processors |
| B. | involve group of algorithms |
| C. | involve group of variables |
| D. | none of these |
| Answer» A. involve group of processors | |
| 135. |
efficiency of data parallel algorithm depends on the |
| A. | efficient implementation of the algorithm |
| B. | efficient implementation of the operation |
| C. | both |
| D. | none |
| Answer» B. efficient implementation of the operation | |
| 136. |
All processes participate in a single ______ interaction operation. |
| A. | global |
| B. | local |
| C. | wide |
| D. | variable |
| Answer» A. global | |
| 137. |
subsets of processes in ______ interaction. |
| A. | global |
| B. | local |
| C. | wide |
| D. | variable |
| Answer» B. local | |
| 138. |
Goal of good algorithm is to implement commonly used _____ pattern. |
| A. | communication |
| B. | interaction |
| C. | parallel |
| D. | regular |
| Answer» A. communication | |
| 139. |
Reduction can be used to find the sum, product, maximum, minimum of _____ of numbers. |
| A. | tuple |
| B. | list |
| C. | sets |
| D. | all of above |
| Answer» C. sets | |
| 140. |
source ____ is bottleneck. |
| A. | process |
| B. | algorithm |
| C. | list |
| D. | tuple |
| Answer» A. process | |
| 141. |
only connections between single pairs of nodes are used at a time is |
| A. | good utilization |
| B. | poor utilization |
| C. | massive utilization |
| D. | medium utilization |
| Answer» B. poor utilization | |
| 142. |
all processes that have the data can send it again is |
| A. | recursive doubling |
| B. | naive approach |
| C. | reduction |
| D. | all |
| Answer» A. recursive doubling | |
| 143. |
The ____ do not snoop the messages going through them. |
| A. | nodes |
| B. | variables |
| C. | tuple |
| D. | list |
| Answer» A. nodes | |
| 144. |
accumulate results and send with the same pattern is... |
| A. | broadcast |
| B. | naive approach |
| C. | recursive doubling |
| D. | reduction symmetric |
| Answer» D. reduction symmetric | |
| 145. |
every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____ |
| A. | parallel |
| B. | vertical |
| C. | horizontal |
| D. | all |
| Answer» A. parallel | |
| 146. |
using different links every time and forwarding in parallel again is |
| A. | better for congestion |
| B. | better for reduction |
| C. | better for communication |
| D. | better for algorithm |
| Answer» A. better for congestion | |
| 147. |
In a balanced binary tree processing nodes is equal to |
| A. | leaves |
| B. | number of elemnts |
| C. | branch |
| D. | none |
| Answer» A. leaves | |
| 148. |
In one -to- all broadcast there is |
| A. | divide and conquer type algorithm |
| B. | sorting type algorithm |
| C. | searching type algorithm |
| D. | simple algorithm |
| Answer» A. divide and conquer type algorithm | |
| 149. |
For sake of simplicity, the number of nodes is a power of |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 150. |
Nides with zero in i least significant bits participate in _______ |
| A. | algorithm |
| B. | broadcast |
| C. | communication |
| D. | searching |
| Answer» C. communication | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.