GATE CSE · 2026 · CS2
Question 37: Algorithms
Give it a try, then reveal the answer to check your work.
Question 37
CS2MCQ2 marksNeeds review
Let
be a weighted directed acyclic graph with
edges and
vertices. Given
and a source vertex
in
, which one of the following options gives the worst case time complexity of the fastest algorithm to find the lengths of shortest paths from
to all vertices that are reachable from
in
?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.
2026CS2
GATE CSE 2026 · Paper 2
Computer Science and Information Technology · Original paper archive
- Section
- Section CS2
- Question type
- Multiple choice (MCQ)
- 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
shortest paths
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.