McqMate

Q. |
## Breadth First Search is equivalent to which of the traversal in the Binary Trees? |

A. | pre-order traversal |

B. | post-order traversal |

C. | level-order traversal |

D. | in-order traversal |

Answer» C. level-order traversal |

3.3k

0

Do you find this helpful?

14

View all MCQs in

High Performance Computing (HPC)No comments yet

- Best-first search (BFS) algorithms can search both graphs and trees.
- Which of the following is not an application of Breadth First Search?
- Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
- The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.
- Simple backtracking is a depth-first search method that terminates upon finding the first solution.
- Is Best First Search a searching algorithm used in graphs.
- important component of best-first search (BFS) algorithms is
- What is the equivalent of general C program with CUDA C: int main(void) { printf("Hello, World!\n"); return 0; }
- _____ algorithms use a heuristic to guide search.
- 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