- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- If there are more than 1 topological sor...

Q. |
## If there are more than 1 topological sorting of a DAG is possible, which of the following is true. |

A. | Many Hamiltonian paths are possible |

B. | No Hamiltonian path is possible |

C. | Exactly 1 Hamiltonian path is possible |

D. | Given information is insufficient to comment anything |

Answer» B. No Hamiltonian path is possible |

View all MCQs in:
Data Structures (DS)

- The topological sorting of any DAG can be done in time.
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
- Which of the following sorting algorithm is stable?
- Which of the following sorting algorithm is of divide-and-conquer type?
- What is an external sorting algorithm?
- What is an internal sorting algorithm?
- What is an in-place sorting algorithm?
- What is the advantage of selection sort over other sorting techniques?
- The earliest use of__________ sorting was in conjunction with network analysis.

Login to Continue

It will take less than 2 minutes

Report MCQ