MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structure
→
Number Jumps Reach End Array Operation in Data Structure
→
Time Complexity of DFS is? (V number of vertices..
1.
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)
Answer» B. O(V)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is not an application of Depth First Search?
Time Complexity of DFS is? (V number of vertices, E number of edges)
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply