GATE CSE · 2026 · CS
Question 50: Algorithms
Give it a try, then reveal the answer to check your work.
Question 50
CSMSQ2 marksNeeds review
Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph
as input, where
and
are the discovery time and finishing time, respectively, of the vertex
.
Suppose that the input directed graph
is a directed acyclic graph (DAG).For an edge
, which of the following options will NEVER be correct?Your answerSelect all correct options. You can choose more than one.
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.
2026CS
GATE CSE 2026 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- Question type
- Multiple select (MSQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
algorithms
GATE CSE 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.