GATE CSE · 2021 · CS
Question 36: Programming and Data Structures
Give it a try, then reveal the answer to check your work.
Question 36
CSMCQ2 marksNeeds review
Let
be an undirected unweighted connected graph. The diameter of
is defined as:
Let
be the adjacency matrix of
.
Define graph
on the same set of vertices with adjacency matrix
, where
Which one of the following statements is true?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.
2021CS
GATE CSE 2021 · 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
programming data structures
GATE CSE previous year questions
Programming and Data Structures
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.