Multiple Choice
Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
A) n*p
B) n-p
C) p/n
D) n/p
Correct Answer:
Verified
Correct Answer:
Verified
Q15: The kernel code is dentified by the _qualifier
Q16: The space required to store the adjacency
Q17: In Dijkstra's all pair shortest path each
Q18: identify Load-Balancing Scheme/s<br>A)asynchronous round robin<br>B)global round robin<br>C)random
Q19: Odd-even transposition sort is a variation of<br>A)quick
Q20: Graph can be represented by<br>A)identity matrix<br>B)adjacency matrix<br>C)sprse
Q21: What is the average running time of
Q23: In parallel Quick Sort Pivot is sent
Q24: A* algorithm is a<br>A)bfs algorithm<br>B)dfs algorithm<br>C)prim\s algorithm<br>D)kruskal\s
Q25: A person wants to visit some places.