## DS | GATE-2008 | PREVIOUS YEAR QUESTIONS| SET-13

DS | GATE-2008 | Data Structures The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity. [GATE – 2008] a. θ(m+n)b. θ(m)c. θ(n)d. θ(mn) Answer : a) The Breadth First Search algorithm has been implemented using the queue data structure. One …

DS | GATE-2008 | PREVIOUS YEAR QUESTIONS| SET-13 Read More »