- Computer Science Engineering (CSE)
- Data Structures (DS)
- ____________ is finding a path/tour thro...

Q. |
## ____________ is finding a path/tour through the graph such that every vertex is visited exactly once. |

A. | Travelling Salesman tour. |

B. | Eulerian tour. |

C. | Hamiltonian tour. |

D. | None. |

Answer» C. Hamiltonian tour. |

View all MCQs in:
Data Structures (DS)

- ______________ a tree means processing it in such a way that each node is visited only once.
- If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- A vertex of degree one is called __________.
- What is the average case time complexity for finding the height of the binary tree?
- The data structure required for Breadth First Traversal on a graph is?
- Which of the following graph traversals closely imitates level order traversal of a binary tree?
- Which of the following statements for a simple graph is correct?
- For the given graph(G), which of the following statements is true?
- What is the number of edges present in a complete graph having n vertices?

Login to Continue

It will take less than 2 minutes

Report MCQ