McqMate

Q. |
## How many times the insert and extract min operations are invoked per vertex? |

A. | 1 |

B. | 2 |

C. | 3 |

D. | 0 |

Answer» A. 1 | |

Explanation: insert and extract min operations are invoked only once per vertex because each vertex is added only once to the set and each edge in the adjacency list is examined only once during the course of algorithm. |

1.3k

0

Do you find this helpful?

21

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- How many edges does a n vertex triangle free graph contains?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?
- Under what condition can a vertex combine and distribute flow in any manner?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- The problem of finding a path in a graph that visits every vertex exactly once is called?
- What is running time of Dijkstra’s algorithm using Binary min- heap method?
- How many times the for loop in the Bellmann Ford Algorithm gets executed?