GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

391.

Consider the following C-program fragment in which i, j and n are integer variables.
for (i = n, j = 0; i > 0; i /= 2, j +=i);
Let val ( j ) denote the value stored in the variable j after termination of the for loop. Which one of the following is true? [1 mark]
(A) val ( j ) = θ (logn)
(B) val ( j ) = θ ( n)
(C) val ( j ) = θ (n)
(D) val ( j ) = θ (nlogn)

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
392.

Which one of the following in place sorting algorithms needs the minimum number of swaps? [1 mark]
(A) Quick sort
(B) Insertion sort
(C) Selection sort
(D) Heap sort

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2006

View Comments [1 Reply]
393.

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, in X[2i+1]. To be able to store any binary tree on n vertices the minimum size of X should be [1 mark]
(A) log₂ n
(B) n
(C) 2n + 1
(D) 2ⁿ -1

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
394.

To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: [1 mark]
(A) Queue
(B) Stack
(C) Heap
(D) B-Tree

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
395.

Consider a weighted complete graph G on the vertex set {v₁, v₂, ....v_n}such that the weight of the edge (v_i, v_j) is 2|i-j|. The weight of a minimum spanning tree of G is:
[1 mark]
(A) n − 1
(B) 2n − 2
(C) ⁿc₂
(D) n²

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
396.

In a binary max heap containing n numbers, the smallest element can be found in time
[1 mark]
(A) O(n)
(B) O(logn)
(C) O(loglogn)
(D) O(1)

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]

801 1 ...‹‹64 6566 67 68 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now