GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

325.

Consider the DAG with V = {1,2,3,4,5,6}, shown below.

Which of the following is NOT a topological ordering? [1 mark]
(A) 1 2 3 4 5 6
(B) 1 3 2 4 5 6
(C) 1 3 2 4 6 5
(D) 3 2 4 1 6 5

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
326.

Let G be the non-planar graph with the minimum possible number of edges. Then G has
[1 mark]
(A) 9 edges and 5 vertices
(B) 9 edges and 6 vertices
(C) 10 edges and 5 vertices
(D) 10 edges and 6 vertices

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
327.

What is the maximum number of different Boolean functions involving n Boolean variables? [1 mark]
(A) n²
(B) 2ⁿ
(C)2^2ⁿ
(D)2^n²

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
328.

Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are: [1 mark]
(A) n and n
(B) n² and n
(C) n² and 0
(D) n and 1

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
329.

Consider the following two statements about the function f (x) = |x| :
P. f (x) is continuous for all real values of x
Q. f (x) is differentiable for all real values of x
Which of the following is TRUE? (1 mark)
(A) P is true and Q is false.
(B) P is false and Q is true.
(C) Both P and Q are true.
(D) Both P and Q are false.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]

330.

Statement for Linked Answer Questions :

[1]	Which one of the following grammars generates the language L = {a_ib_j \| i≠j} [2 marks]

[2]	In the correct grammar above, what is the length of the derivation (number of steps starring from S) to generate the string l^ab^m with l ≠ m? [2 marks] (A) max (l,m) + 2 (B) l + m + 2 (C) l + m + 3 (D) max (l,m) + 3

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]

801 1 ...‹‹53 5455 56 57 ›› ... 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