McqMate

Q. |
## _____ algorithms use a heuristic to guide search. |

A. | bfs |

B. | dfs |

C. | a and b |

D. | none of above |

Answer» A. bfs |

1.5k

0

Do you find this helpful?

2

View all MCQs in

High Performance Computing (HPC)No comments yet

- The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.
- Best-first search (BFS) algorithms can search both graphs and trees.
- important component of best-first search (BFS) algorithms is
- ______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.
- If the heuristic is admissible, the BFS finds the optimal solution.
- Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
- Which of the following is not true about comparison based sorting algorithms?
- Which of the following statements is NOT TRUE for Internal Sorting algorithms
- Parallel algorithms often require a single process to send identical data to all other processes or to a subset of them. This operation is known as _________?
- The search overhead factor of the parallel system is defined as the ratio of the work done by the parallel formulation to that done by the sequential formulation