Computer Science and Information Technology
2025 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2025 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 43–45 of 65. Imported answers require review unless explicitly marked reviewed.
Question 43
Open questionCSMCQ2 marksNeeds review
Let
be an undirected and unweighted graph with 100 vertices. Let
denote the number of edges in a shortest path between vertices
and
in
. Let the maximum value of
,
such that
, be 30. Let
be a breadth-first-search tree of
. Which ONE of the given options is CORRECT for every such graph
?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 answerQuestion 44
Open questionCSMCQ2 marksNeeds review
Consider the following two languages over the alphabet
:
Which ONE of the following statements 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 answerQuestion 45
Open questionCSMCQ2 marksNeeds review
Consider the following two languages over the alphabet
, where
and
are natural numbers.
Which ONE of the following statements 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 answer