McqMate

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) |

Answer» A. o(v + e) |

1.7k

0

Do you find this helpful?

6

View all MCQs in

High Performance Computing (HPC)No comments yet

- Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
- In Parallel DFS processes has following roles.(Select multiple choices if applicable)
- 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
- The space required to store the adjacency matrix of a graph with n vertices is
- A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
- The graph of tasks (nodes) and their interactions/data exchange (edges)?
- The complexity of bubble sort is Θ(n2).