Top 250+ Solved High Performance Computing (HPC) MCQ Questions Answer
Q. While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in
a. one bit
b. two bits
c. three bits
d. four bits
Q. Which of following is NOT A WAY of mapping the input wires of the bitonicsorting network to a MESH of processes
a. row major mapping
b. column major mapping
c. row major snakelike mapping
d. row major shuffled mapping
Q. Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n)2. begin3. for i := n - 1 downto 1 do4. for j := 1 to i do5. compare-exchange(aj, aj + 1);6. end X_SORT
a. selection sort
b. bubble sort
c. parallel selcetion sort
d. parallel bubble sort
Q. What is TRUE about SHELL SORT
a. moves elements only one position at a time
b. moves elements long distance
c. during second phase algorithm switches to odd even transposition sort
d. both 2 and 3
Q. Which is the fastest sorting algorithm
a. bubble sort
b. odd-even transposition sort
c. shell sort
d. quick sort
Q. What is the average running time of a quick sort algorithm?
a. o(n)
b. o(n log n)
c. o(n2)
d. o(log n)
Q. Odd-even transposition sort is a variation of
a. quick sort
b. shell sort
c. bubble sort
d. selection sort
Q. What is the average case time complexity of odd-even transposition sort?
a. o(n log n)
b. o(n)
c. o(log n)
d. o(n2)
Q. In parallel Quick Sort Pivot is sent to processes by
a. broadcast
b. multicast
c. selective multicast
d. unicast
Q. In parallel Quick Sort each process divides the unsorted list into
a. n lists
b. 2 lists
c. 4 lists
d. n-1 lists
Q. Time Complexity of DFS is? (V – number of vertices, E – number of edges)
a. o(v + e)
b. o(v)
c. o(e)
d. o(v*e)