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.
Consider a complete graph $K_{n}$ with $n$ vertices ( $n>4$ ). Note that multiple spanning trees can be constructed over $K_{n}$. Each of these spanning trees is represented as a…
Answer: C
This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.