- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the length of an augmenting path...

Q. |
## What is the length of an augmenting path? |

A. | even |

B. | odd |

C. | depends on graph |

D. | 1 |

Answer» B. odd | |

Explanation: the length of an augmenting path in a bipartite graph is always said to be always odd. |

View all MCQs in:
Design and Analysis of Algorithms

- A matching M is maximal if and only if there exists no augmenting path with respect to M.
- What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- For which of the following, the length of the string is not equal to the length of the longest palindromic subsequence?
- A simple acyclic path between source and sink which pass through only positive weighted edges is called?
- Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
- The problem of finding a path in a graph that visits every vertex exactly once is called?
- Hamiltonian path problem is

Login to Continue

It will take less than 2 minutes

Report MCQ