GateQA is a free GATE CS preparation platform featuring 3,500+ previous-year questions (1987–2026),
36,000+ aptitude questions, subject-wise and year-wise mock tests, performance analytics,
and full offline support. Practice Operating Systems, Algorithms, DBMS, Computer Networks,
Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, and more.
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as: $$\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortest path b…
Answer: A
This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.