M

Mr. Dubey • 100.69K Points
Coach

Q. Graph traversal is different from a tree traversal, because

  • (A) trees are not connected.
  • (B) graphs may have loops.
  • (C) trees have root.
  • (D) None is true as tree is a subset of graph.
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. Is the connectivity of the neuron that give simple devices their real power?

Q. If A is any non-empty set and R is a partial ordered relation on set A, then the ordered pair (A,R) is called -------

Q. _______ clustering technique start with as many clusters as there are records, with each cluster having only one record.

Q. In rate monotonic scheduling algorithm Select one:

Q. General-purpose class that allows a response to be rendered using a marshaller.

Q. If a Direct approach to software project sizing is taken, size can be measured in

Q. Every call to publish() will return a class that conforms to the interface.

Q. Devices and other systems ________

Q. Which of the following is not a primary grain in analytical modeling.

Q. In which of the following cases will K-means clustering fail to give good results? 1) Data points with outliers 2) Data points with different densitie

Question analytics