- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Dijkstra’s Algorithm run on a weighted, ...

Q. |
## Dijkstra’s Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: the equality d[u]=delta(s,u) holds good when vertex u is added to set s and this equality is maintained thereafter by the upper bound property. |

View all MCQs in:
Design and Analysis of Algorithms

- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- 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?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- A matching that matches all the vertices of a graph is called?
- Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.
- Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
- A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
- What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?

Login to Continue

It will take less than 2 minutes

Report MCQ