Previous GATE Questions in Programming and DS

55 votes
8 answers
301
An $n \times n$ array $v$ is defined as follows:$v\left[i,j\right] = i - j$ for all $i, j, i \leq n, 1 \leq j \leq n$The sum of the elements of the array $v$ is$0$$n-1$$n...
0 votes
0 answers
302
28 votes
5 answers
305
A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...
25 votes
3 answers
306
Consider the binary tree in the figure below:What structure is represented by the binary tree?
25 votes
5 answers
307
32 votes
8 answers
308
44 votes
2 answers
309
24 votes
3 answers
310
20 votes
5 answers
311
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
26 votes
3 answers
316
50 votes
2 answers
320
The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is$\Theta(n\log n)$$\Theta(n2^n)$$\Theta(n)$$\Theta(\log n)$