1. Home
  2. GATE
  3. Data Science and Artificial Intelligence
  4. Topics
  5. concept:shortest-path
Data Science and Artificial Intelligence

GATE DA concept:shortest-path PYQs

Build your understanding with focused practice from past exam papers.

How to practice concept:shortest-path

Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.

GATE DA syllabus

Questions 1–2 of 2. Imported answers require independent review unless marked reviewed.

Topic practice 2 questionsPage 1 of 1

Question 58

Open question
daMSQ2 marksNeeds review
Let

be a simple, unweighted, and undirected graph. A subset of the vertices and edges of

are shown below.
Diagram for Data Science and Artificial Intelligence question 58

It is given that

is a shortest path between

and

;

is a shortest path between

and

;

is a shortest path between

and

. Which of the following is/are NOT the edges of

?
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 answer

Question 14

Open question
DAMCQ1 markNeeds review
Consider performing depth-first search (DFS) on an undirected and unweighted graph

starting at vertex

. For any vertex

in

,

is the length of the shortest path from

to

. Let

be an edge in

such that

. If the edge

is explored first in the direction from

to

during the above DFS, then

becomes a ______ edge.
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 answer