M

Mr. Dubey • 100.69K Points
Coach

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.
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. How do you close a file object (fp)?

Q. FTP is built on _____ architecture

Q. An RPC (remote procedure call) is initiated by the:

Q. Which of the following is a self – balancing binary search tree?

Q. What is the output of the following program? D = dict() for i in range (3): for j in range(2): D[i] = j print(D)

Q. ___transactions have business firms at one end and its customers on the other end.

Q. Which of the following expression operators increments a varibale by one ?

Q. Which of the following logic families has the highest maximum clock frequency?

Q. Which jamming method produces greater degradation?

Q. The Family of recursive language is not closed under which of the following operations:

Question analytics