McqMate

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 |

1.9k

0

Do you find this helpful?

12

View all MCQs in

Data Structures (DS)No comments yet

- 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.
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
- 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?