GATE CSE · 2026 · CS
Question 41: Algorithms
Give it a try, then reveal the answer to check your work.
Question 41
CSMCQ2 marksNeeds review
Let
be an undirected, edge-weighted graph with integer weights. The weight of a path is the sum of the weights of the edges in that path. The length of a path is the number of edges in that path.Let
be a vertex in
. For every
and for every
, let
denote the weight of a shortest path (in terms of weight) from
to
of length at most
. If there is no path from
to
of length at most
, then
.Consider the statements:
S1: For every
and
,
.S2: For every
, if
is part of a shortest path (in terms of weight) from
to
, then for every
,
.Which one of the following options is correct?
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.
2026CS
GATE CSE 2026 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- 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.