gate previous year question of data structure

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 »

DS | GATE-2006 | Data Structures A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. The root is stored at X[1]. For a node stored at X[i], the left child, if any, is stored in X[2i] and the right child, if any, …

DS | GATE-2006 | PREVIOUS YEAR QUESTIONS| SET-15 Read More »