McqMate

Q. |
## Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges) |

A. | o(v + e) |

B. | o(v) |

C. | o(e) |

D. | o(v*e) |

Answer» A. o(v + e) |

3.9k

0

Do you find this helpful?

32

View all MCQs in

High Performance Computing (HPC)No comments yet

- Time Complexity of DFS is? (V – number of vertices, E – number of edges)
- Breadth First Search is equivalent to which of the traversal in the Binary Trees?
- Which of the following is not an application of Breadth First Search?
- 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.
- Simple backtracking is a depth-first search method that terminates upon finding the first solution.
- What is the worst case time complexity of a quick sort algorithm?
- What is the average case time complexity of odd-even transposition sort?
- In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION
- A complete graph is a graph in which each pair of vertices is adjacent