GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

247.

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity [1 mark]
(A) Θ(n)
(B) Θ(m)
(C) Θ(m+ n)
(D) Θ(mn)

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
248.

Let r denote number system radix. The only value(s) of r that satisfy the equation
√121_r = 11_r is / are [1 mark]
(A) decimal 10
(B) decimal 11
(C) decimal 10 and 11
(D) any value >2

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
249.

In the Karnaugh map shown below, X denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map? [1 mark]

(A) b .d + a .d
(B) a .b + b .d + a .b.d
(C) b .d + a .b.d
(D) a .b + b .d + a .d

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
250.

In the IEEE floating point representation the hexadecimal value 0x00000000 corresponds to [1 mark]
(A) The normalized value 2^-127
(B) The normalized value 2^-126
(C) The normalized value +0
(D) The special value +0

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
251.

The following system of equations
x₁ + x₂ + 2x₃= 1
x₁ + 2x₂ + 3x₃ = 2
x₁ + 4x₂ + αx₃ = 4
has a unique solution. The only possible value(s) for α is/are [1 mark]
(A) 0
(B) either 0 or 1
(C) one of 0, 1 or -1
(D) any real number

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]
252.

If P, Q, R are subsets of the universal set U, then
(P∩Q∩R) ∪ (P^c∪Q∪R) ∪ Q^c ∪ R^cis : [1 mark]
(A) Q^c ∪ R^c
(B) P ∪ Q^c ∪ R^c
(C) P^c ∪ Q^c ∪ R^c
(D) ∪

asked in Computer Science And Engineering, 2008

View Comments [0 Reply]

801 1 ...‹‹40 4142 43 44 ›› ... 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