πŸ“Š High Performance Computing
Q. to solve the all-pairs shortest paths problem which algorithm's is/are used
a) Floyd's algorithm
b) Dijkstra's single-source shortest paths
c) Prim's Algorithm
d) Kruskal's Algorithm
  • (A) a) and c)
  • (B) a) and b)
  • (C) b) and c)
  • (D) c) and d)
πŸ’¬ Discuss
βœ… Correct Answer: (B) a) and b)
πŸ“Š High Performance Computing
Q. M.J. Flynn's parallel processing classification is based on:
  • (A) multiple instructions
  • (B) multiple data
  • (C) both (a) and (b)
  • (D) none of the above
πŸ’¬ Discuss
βœ… Correct Answer: (C) both (a) and (b)
πŸ“Š High Performance Computing
Q. In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options
  • (A) x\ = min { x , y } and y\ = min { x , y }
  • (B) x\ = max { x , y } and y\ = min { x , y }
  • (C) x\ = min { x , y } and y\ = max{ x , y }
  • (D) x\ = max { x , y } and y\ = max { x , y }
πŸ’¬ Discuss
βœ… Correct Answer: (C) x\ = min { x , y } and y\ = max{ x , y }
πŸ“Š High Performance Computing
Q. In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options
  • (A) x\ = min { x , y } and y\ = min { x , y }
  • (B) x\ = max { x , y } and y\ = min { x , y }
  • (C) x\ = min { x , y } and y\ = max{ x , y }
  • (D) x\ = max { x , y } and y\ = max { x , y }
πŸ’¬ Discuss
βœ… Correct Answer: (B) x\ = max { x , y } and y\ = min { x , y }
πŸ“Š High Performance Computing
Q. In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.
  • (A) internal sorting
  • (B) internal searching
  • (C) external sorting
  • (D) external searching
πŸ’¬ Discuss
βœ… Correct Answer: (A) internal sorting

Jump to