Data Structures and Algorithms - Advanced Algorithm

21. The number of edges in a 3X5 mesh is ______

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


22. Which of the following CRCW PRAM variants is not known to be self-simulating?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


23. Suppose we have three sorting algorithms X1, X2, and X3 on PRAMs.
X1 runs in O(log n) time using nlog n processors.
X2 runs in O(log2 n) time using n/log n processors.
X3 runs in O(log n log log n) time using n/log n processors.
Which of the algorithms is/are optimal?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


24. A CREW PRAM algorithm of 4 steps have degrees of parallelism of 10, 14, 8 and 22 in its four steps. On a PRAM with 12 processors, the algorithm can be simulated in ___ steps

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


25. When the balanced binary tree based parallel algorithm for finding prefix sums is run on "1 2 4 6 9 13 18 25", what is the value send to the right child by the internal node whose sum is 65?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *