GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

499.

Let A[1,…,n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is θ(m). Consider the following program fragment written in a C like language:
counter = 0;
for (i =1; i < = n; i++)
{if (a[i] == 1) counter++;
else {f (counter); counter = 0;)
}
The complexity of this program fragment is [2 marks]
(a) Ω(n²)
(b) Ω(nlogn) and O(n²)
(c) θ(n)
(d) o(n)

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
500.

Let G₁ = (V, E₁) and G₂ = (V, E₂) be connected graphs on the same vertex set V with more than two vertices. If G₁ ∩ G₂ = (V, E₁ ∩ E₂ ) is not a connected graph then the graph G₁ ∪ G₂ = (V, E₁ ∪ E₂) [2 marks]
(A) cannot have a cut vertex
(B) must have a cycle
(C) must have a cut –edge (bridge)
(D) has a chromatic number strictly greater than those of G1 and G2

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
501.

A point is randomly selected with uniform probability in the X-Y plane within the rectangle with corners at (0,0), (1,0), (1,2) and (0,2). If p is the length of the position vector of the point, the expected value of p² is [2 marks]
(a) 2/3
(b) 1
(c) 4/3
(d) 5/3

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
502.

How many graphs on n labeled vertices exist which have at least (n²-3n)/2 edges?
[2 marks]

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
503.

Two n bit binary strings, S₁ and S₂ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to d is [2 marks]
(a) ⁿc_d/2ⁿ
(b) ⁿc_d/2^d
(c) d/2ⁿ
(d) 1/2^d

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
504.

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is [2 marks]

(a) 2
(b) 3
(c) 4
(d) 5

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]

801 1 ...‹‹82 8384 85 86 ›› ... 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