Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
GATE | GATE CS Mock 2018 | Set 2 | Question 22
Last Updated :
Discuss
Comments
Which of following option is not correct regarding depth first searching?
In a depth-first traversal of a graph G with V vertices, E edges are marked as tree edges. The number of connected components in G is (E - V).
Depth-first search requires O(V^2) time if implemented with an adjacency matrix.
Depth-first search requires O(V + E) time if implemented with adjacency lists
None of these
This question is part of this quiz :
Top MCQs on Tree Traversal with Interview Question and Answers | DSA Quiz,GATE CS Mock 2018 | Set 2Share your thoughts in the comments
GeeksforGeeks