M

Mr. Dubey • 100.69K Points
Coach

Q. Time Complexity of DFS is? (V – number of vertices, E – number of edges)

  • (A) o(v + e)
  • (B) o(v)
  • (C) o(e)
  • (D) o(v*e)
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. g=f(8) print(next(g))

Q. For large data transfers, is used.

Q. Suzuki-Kasami's Broadcast Algorithm is an

Q. Boundary value analysis is the technique comes under……

Q. Multidimensional database is otherwise known as____________.

Q. Cloud ________ are standardized in order to appeal to the majority of its audience.

Q. A transparent DBMS

Q. McFadden has defined normalization in his which book

Q. The__model is 7 layer architecture where each layer is having some specific functionality to perform.

Q. Complete the following analogy:- Registers are to RAM’s as Cache’s are to

Question analytics