GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

727.

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is [1 mark]
(a) log n
(b) n/2
(c) log₂n -1
(d) n

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
728.

The minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have the same colour is [1 mark]
(a) 2
(b) 3
(c) 4
(d) n - 2[n/2] + 2

last reply by CpjJwWHV • 11 years ago • asked in Computer Science And Engineering, 2002

View Comments [2 Reply]
729.

The solution to the recurrence equation T(2^k) = 3T(2^(k-1)) + 1, T(1) = 1 is
[1 mark]
(a) 2^k
(b) [3^(k+1)-1]/2
(c) 3log₂k
(d) 2log₃k

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
730.

The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree [1 mark]
(a) 0 but not 1
(b) 1 but not 0
(c) 0 or 1
(d) 2

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
731.

The rank of the matrix given below is :: [1 mark]

1 1

0 0

(a) 4
(b) 2
(c) 1
(d) 0

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
732.

We wish to construct a B⁺ tree with fan-out (the number of pointers per node) equal to 3 for the following set of key values:
80, 50, 10, 70, 30, 100, 90
Assume that the tree is initially empty and the values are added in the order given.
(a) Show the tree after insertion of 10, after insertion of 30, and after insertion of 90. Intermediate trees need not be shown.
(b) The key values 30 and 10 are now deleted from the tree in that order. Show the tree after each deletion.
[5 marks]

asked in Computer Science And Engineering, 2001

View Comments [0 Reply]

801 1 ...‹‹120 121122 123 124 ›› ... 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