GATE DA · 2026 · DA
Question 40: Programming, Data Structures and Algorithms
Give it a try, then reveal the answer to check your work.
Question 40
DAMCQ2 marksNeeds review
Consider a directed graph
, where
is the finite set of vertices and
is the set of directed edges between the vertices.
may contain cycles but there is no self-loop. Further,
may not be strongly connected.Let
be the graph obtained by reversing the directions of all the edges in
without changing the set of vertices.Assume that Breadth First Search (BFS) or Depth First Search (DFS) from any given vertex
of a graph visits only the reachable vertices from
in that graph.Which of the following statements must always be true, regardless of the structure of
?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2026DA
GATE DA 2026 · Paper 1
Data Science and Artificial Intelligence · Original paper archive
- Section
- Data Science and Artificial Intelligence
- Question type
- Multiple choice (MCQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
data science
GATE DA previous year questions
artificial intelligence
GATE DA previous year questions
computing
GATE DA previous year questions
Programming, Data Structures and Algorithms
GATE DA previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.